Base | Representation |
---|---|
bin | 1011000000011011100010… |
… | …1110101100011011111010 |
3 | 1120211221102201200211212022 |
4 | 2300012320232230123322 |
5 | 3041234420130334320 |
6 | 41423331530114442 |
7 | 2356225250515100 |
oct | 260067056543372 |
9 | 46757381624768 |
10 | 12102022121210 |
11 | 3946490a9655a |
12 | 143555287ba22 |
13 | 69a2a6120448 |
14 | 2dba53415c70 |
15 | 15ec0493c325 |
hex | b01b8bac6fa |
12102022121210 has 24 divisors (see below), whose sum is σ = 25340152442580. Its totient is φ = 4149264727104.
The previous prime is 12102022121153. The next prime is 12102022121237. The reversal of 12102022121210 is 1212122020121.
It can be written as a sum of positive squares in 2 ways, for example, as 11532822792001 + 569199329209 = 3396001^2 + 754453^2 .
It is a Curzon 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 11 ways as a sum of consecutive naturals, for example, 12349001675 + ... + 12349002654.
Almost surely, 212102022121210 is an apocalyptic number.
12102022121210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12102022121210 is an abundant number, since it is smaller than the sum of its proper divisors (13238130321370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102022121210 is a wasteful number, since it uses less digits than its factorization.
12102022121210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24698004350 (or 24698004343 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12102022121210 its reverse (1212122020121), we get a palindrome (13314144141331).
The spelling of 12102022121210 in words is "twelve trillion, one hundred two billion, twenty-two million, one hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •