Base | Representation |
---|---|
bin | 1011000000011011100101… |
… | …0100110011111010011110 |
3 | 1120211221110102111111110002 |
4 | 2300012321110303322132 |
5 | 3041234430210111220 |
6 | 41423332524214302 |
7 | 2356225431452426 |
oct | 260067124637236 |
9 | 46757412444402 |
10 | 12102032113310 |
11 | 39464966a0797 |
12 | 143555609a392 |
13 | 69a2a820b529 |
14 | 2dba54897486 |
15 | 15ec05762c75 |
hex | b01b9533e9e |
12102032113310 has 8 divisors (see below), whose sum is σ = 21783657803976. Its totient is φ = 4840812845320.
The previous prime is 12102032113291. The next prime is 12102032113361. The reversal of 12102032113310 is 1331123020121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×121020321133102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 605101605656 + ... + 605101605675.
It is an arithmetic number, because the mean of its divisors is an integer number (2722957225497).
Almost surely, 212102032113310 is an apocalyptic number.
12102032113310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12102032113310 is a deficient number, since it is larger than the sum of its proper divisors (9681625690666).
12102032113310 is a wasteful number, since it uses less digits than its factorization.
12102032113310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1210203211338.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12102032113310 its reverse (1331123020121), we get a palindrome (13433155133431).
The spelling of 12102032113310 in words is "twelve trillion, one hundred two billion, thirty-two million, one hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •