Base | Representation |
---|---|
bin | 1010111011001100100110… |
… | …0100000011101000101110 |
3 | 1120112100100121121122011122 |
4 | 2232303021210003220232 |
5 | 3033301300204411420 |
6 | 41314142014220542 |
7 | 2346563201205452 |
oct | 256631144035056 |
9 | 46470317548148 |
10 | 12012110232110 |
11 | 391134208649a |
12 | 142003b4b4752 |
13 | 69197763b2c1 |
14 | 2d75640d2662 |
15 | 15c6e11b7725 |
hex | aecc9903a2e |
12012110232110 has 8 divisors (see below), whose sum is σ = 21621798417816. Its totient is φ = 4804844092840.
The previous prime is 12012110232097. The next prime is 12012110232113. The reversal of 12012110232110 is 1123201121021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012110232113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 600605511596 + ... + 600605511615.
It is an arithmetic number, because the mean of its divisors is an integer number (2702724802227).
Almost surely, 212012110232110 is an apocalyptic number.
12012110232110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12012110232110 is a deficient number, since it is larger than the sum of its proper divisors (9609688185706).
12012110232110 is a wasteful number, since it uses less digits than its factorization.
12012110232110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201211023218.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12012110232110 its reverse (1123201121021), we get a palindrome (13135311353131).
The spelling of 12012110232110 in words is "twelve trillion, twelve billion, one hundred ten million, two hundred thirty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •