Base | Representation |
---|---|
bin | 111110100100111… |
… | …1110100001001000 |
3 | 12102100002020022210 |
4 | 1331021332201020 |
5 | 13300020023433 |
6 | 544205145120 |
7 | 103014504516 |
oct | 17511764110 |
9 | 5370066283 |
10 | 2099767368 |
11 | 98829a336 |
12 | 4a725b1a0 |
13 | 276038cca |
14 | 15cc294b6 |
15 | c451d463 |
hex | 7d27e848 |
2099767368 has 32 divisors (see below), whose sum is σ = 5525704800. Its totient is φ = 663084288.
The previous prime is 2099767367. The next prime is 2099767447. The reversal of 2099767368 is 8637679902.
It is a happy number.
2099767368 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×20997673683 (a number of 29 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (2099767363) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2301921 + ... + 2302832.
It is an arithmetic number, because the mean of its divisors is an integer number (172678275).
Almost surely, 22099767368 is an apocalyptic number.
It is an amenable number.
2099767368 is an abundant number, since it is smaller than the sum of its proper divisors (3425937432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2099767368 is a wasteful number, since it uses less digits than its factorization.
2099767368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4604781 (or 4604777 counting only the distinct ones).
The product of its (nonzero) digits is 6858432, while the sum is 57.
The square root of 2099767368 is about 45823.2186560482. The cubic root of 2099767368 is about 1280.5318769409.
The spelling of 2099767368 in words is "two billion, ninety-nine million, seven hundred sixty-seven thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •