Base | Representation |
---|---|
bin | 11011010011110101001010… |
… | …011110101110001010000011 |
3 | 120202021101221010000001202000 |
4 | 123103311022132232022003 |
5 | 111220340300030000003 |
6 | 1103241435444555043 |
7 | 34204443005564142 |
oct | 3323651236561203 |
9 | 522241833001660 |
10 | 120110010000003 |
11 | 352a8407424491 |
12 | 1157a15b3b2a83 |
13 | 520342ca1842a |
14 | 21934d96d7759 |
15 | dd450c5761a3 |
hex | 6d3d4a7ae283 |
120110010000003 has 32 divisors (see below), whose sum is σ = 184207086336000. Its totient is φ = 77268293517600.
The previous prime is 120110009999927. The next prime is 120110010000041. The reversal of 120110010000003 is 300000010011021.
It is not a de Polignac number, because 120110010000003 - 28 = 120110009999747 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a self number, because there is not a number n which added to its sum of digits gives 120110010000003.
It is not an unprimeable number, because it can be changed into a prime (120110010000083) 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, 205296153 + ... + 205880378.
It is an arithmetic number, because the mean of its divisors is an integer number (5756471448000).
Almost surely, 2120110010000003 is an apocalyptic number.
120110010000003 is a deficient number, since it is larger than the sum of its proper divisors (64097076335997).
120110010000003 is a wasteful number, since it uses less digits than its factorization.
120110010000003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411176920 (or 411176914 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 120110010000003 its reverse (300000010011021), we get a palindrome (420110020011024).
The spelling of 120110010000003 in words is "one hundred twenty trillion, one hundred ten billion, ten million, three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •