Base | Representation |
---|---|
bin | 11101011011001000110… |
… | …10111111100000000011 |
3 | 10120122120110211121211210 |
4 | 32231210122333200003 |
5 | 113031013020041003 |
6 | 2052240431541203 |
7 | 133020401106222 |
oct | 16554432774003 |
9 | 3518513747753 |
10 | 1011002112003 |
11 | 35a844376544 |
12 | 143b3268a803 |
13 | 7444c7825a0 |
14 | 36d0b706cb9 |
15 | 1b4725c1503 |
hex | eb646bf803 |
1011002112003 has 32 divisors (see below), whose sum is σ = 1477380199680. Its totient is φ = 611162778240.
The previous prime is 1011002111953. The next prime is 1011002112011. The reversal of 1011002112003 is 3002112001101.
It is not a de Polignac number, because 1011002112003 - 29 = 1011002111491 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1011002112003.
It is not an unprimeable number, because it can be changed into a prime (1011002112013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2999268 + ... + 3319278.
It is an arithmetic number, because the mean of its divisors is an integer number (46168131240).
Almost surely, 21011002112003 is an apocalyptic number.
1011002112003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1011002112003 is a deficient number, since it is larger than the sum of its proper divisors (466378087677).
1011002112003 is a wasteful number, since it uses less digits than its factorization.
1011002112003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321459.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1011002112003 its reverse (3002112001101), we get a palindrome (4013114113104).
The spelling of 1011002112003 in words is "one trillion, eleven billion, two million, one hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •