Base | Representation |
---|---|
bin | 1011000110110001111011… |
… | …1000101110101010100100 |
3 | 1121020101000021011221111222 |
4 | 2301230132320232222210 |
5 | 3100031323203211322 |
6 | 41545412342315512 |
7 | 2400136460130644 |
oct | 261543670565244 |
9 | 47211007157458 |
10 | 12211110210212 |
11 | 3988780409411 |
12 | 1452718128b98 |
13 | 6a766c713334 |
14 | 30304145c524 |
15 | 16298b953e42 |
hex | b1b1ee2eaa4 |
12211110210212 has 24 divisors (see below), whose sum is σ = 21689882033400. Its totient is φ = 6014511109376.
The previous prime is 12211110210139. The next prime is 12211110210241. The reversal of 12211110210212 is 21201201111221.
It can be written as a sum of positive squares in 4 ways, for example, as 820593209956 + 11390517000256 = 905866^2 + 3374984^2 .
It is a super-2 number, since 2×122111102102122 (a number of 27 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 63660503 + ... + 63852030.
It is an arithmetic number, because the mean of its divisors is an integer number (903745084725).
Almost surely, 212211110210212 is an apocalyptic number.
It is an amenable number.
12211110210212 is a deficient number, since it is larger than the sum of its proper divisors (9478771823188).
12211110210212 is a wasteful number, since it uses less digits than its factorization.
12211110210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127512895 (or 127512893 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12211110210212 its reverse (21201201111221), we get a palindrome (33412311321433).
The spelling of 12211110210212 in words is "twelve trillion, two hundred eleven billion, one hundred ten million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •