Base | Representation |
---|---|
bin | 1010111011001000111010… |
… | …0011011011000001011010 |
3 | 1120112020210121201022011110 |
4 | 2232302032203123001122 |
5 | 3033242233233210020 |
6 | 41313455450441150 |
7 | 2346526520152605 |
oct | 256621643330132 |
9 | 46466717638143 |
10 | 12011120210010 |
11 | 3910984258209 |
12 | 141ba03a331b6 |
13 | 69184a4b58cc |
14 | 2d74ac82133c |
15 | 15c6843078e0 |
hex | aec8e8db05a |
12011120210010 has 32 divisors (see below), whose sum is σ = 28971546249600. Its totient is φ = 3186870084288.
The previous prime is 12011120209981. The next prime is 12011120210069. The reversal of 12011120210010 is 1001202111021.
12011120210010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1005950497 + ... + 1005962436.
It is an arithmetic number, because the mean of its divisors is an integer number (905360820300).
Almost surely, 212011120210010 is an apocalyptic number.
12011120210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12011120210010 is an abundant number, since it is smaller than the sum of its proper divisors (16960426039590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011120210010 is a wasteful number, since it uses less digits than its factorization.
12011120210010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2011913142.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12011120210010 its reverse (1001202111021), we get a palindrome (13012322321031).
It can be divided in two parts, 12011 and 120210010, that added together give a palindrome (120222021).
The spelling of 12011120210010 in words is "twelve trillion, eleven billion, one hundred twenty million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •