Base | Representation |
---|---|
bin | 10100100111100001… |
… | …00000110100100010 |
3 | 1001120102002111221220 |
4 | 22103300200310202 |
5 | 140132114341230 |
6 | 5030204555510 |
7 | 541204056216 |
oct | 122360406442 |
9 | 31512074856 |
10 | 11068902690 |
11 | 477011a46a |
12 | 218ab52b96 |
13 | 10752a0881 |
14 | 7700c8946 |
15 | 44bb4ed10 |
hex | 293c20d22 |
11068902690 has 32 divisors (see below), whose sum is σ = 26619506496. Its totient is φ = 2945691840.
The previous prime is 11068902679. The next prime is 11068902707. The reversal of 11068902690 is 9620986011.
It is a super-2 number, since 2×110689026902 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 360997 + ... + 390456.
It is an arithmetic number, because the mean of its divisors is an integer number (831859578).
Almost surely, 211068902690 is an apocalyptic number.
11068902690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11068902690 is an abundant number, since it is smaller than the sum of its proper divisors (15550603806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11068902690 is a wasteful number, since it uses less digits than its factorization.
11068902690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751954.
The product of its (nonzero) digits is 46656, while the sum is 42.
The spelling of 11068902690 in words is "eleven billion, sixty-eight million, nine hundred two thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •