Base | Representation |
---|---|
bin | 1010111011101110001111… |
… | …0011011010111101100110 |
3 | 1120120012122221110210112010 |
4 | 2232323203303122331212 |
5 | 3033423243420331042 |
6 | 41322234034135050 |
7 | 2350333031323443 |
oct | 256734363327546 |
9 | 46505587423463 |
10 | 12021140402022 |
11 | 3915156403834 |
12 | 142193b721486 |
13 | 6927864229cb |
14 | 2d7b7d51c9ca |
15 | 15ca6dd5359c |
hex | aeee3cdaf66 |
12021140402022 has 8 divisors (see below), whose sum is σ = 24042280804056. Its totient is φ = 4007046800672.
The previous prime is 12021140402021. The next prime is 12021140402077. The reversal of 12021140402022 is 22020404112021.
It is a sphenic number, since it is the product of 3 distinct primes.
12021140402022 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 12021140402022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021140402021) 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, 1001761700163 + ... + 1001761700174.
It is an arithmetic number, because the mean of its divisors is an integer number (3005285100507).
Almost surely, 212021140402022 is an apocalyptic number.
12021140402022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021140402022 is a wasteful number, since it uses less digits than its factorization.
12021140402022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2003523400342.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 12021140402022 its reverse (22020404112021), we get a palindrome (34041544514043).
The spelling of 12021140402022 in words is "twelve trillion, twenty-one billion, one hundred forty million, four hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •