Base | Representation |
---|---|
bin | 11101011001010010110… |
… | …10011100010010000011 |
3 | 10120120000110222102011010 |
4 | 32230221122130102003 |
5 | 113022001100041003 |
6 | 2051554304452003 |
7 | 132654020204646 |
oct | 16545132342203 |
9 | 3516013872133 |
10 | 1010012112003 |
11 | 35a386562924 |
12 | 1438b701a003 |
13 | 74322636c7b |
14 | 36c5603da5d |
15 | 1b415718003 |
hex | eb2969c483 |
1010012112003 has 8 divisors (see below), whose sum is σ = 1346739821568. Its totient is φ = 673312905224.
The previous prime is 1010012111989. The next prime is 1010012112019. The reversal of 1010012112003 is 3002112100101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010012112003 - 214 = 1010012095619 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010012112003.
It is not an unprimeable number, because it can be changed into a prime (1010012114003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7042875 + ... + 7184852.
It is an arithmetic number, because the mean of its divisors is an integer number (168342477696).
Almost surely, 21010012112003 is an apocalyptic number.
1010012112003 is a deficient number, since it is larger than the sum of its proper divisors (336727709565).
1010012112003 is a wasteful number, since it uses less digits than its factorization.
1010012112003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14251393.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1010012112003 its reverse (3002112100101), we get a palindrome (4012124212104).
The spelling of 1010012112003 in words is "one trillion, ten billion, twelve million, one hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •