Base | Representation |
---|---|
bin | 1010000011110010000111… |
… | …11011010101011001011100 |
3 | 2220022200011020201012020101 |
4 | 11001321003323111121130 |
5 | 10344404203111431022 |
6 | 115013520032430444 |
7 | 4442063462623123 |
oct | 501710373253134 |
9 | 86280136635211 |
10 | 22120221202012 |
11 | 705915121731a |
12 | 25930693a8424 |
13 | c45c0a80101b |
14 | 5668a5594aba |
15 | 2855e7460627 |
hex | 141e43ed565c |
22120221202012 has 24 divisors (see below), whose sum is σ = 39611170135152. Its totient is φ = 10802751052800.
The previous prime is 22120221202003. The next prime is 22120221202021. The reversal of 22120221202012 is 21020212202122.
It is an interprime number because it is at equal distance from previous prime (22120221202003) and next prime (22120221202021).
It is a super-2 number, since 2×221202212020122 (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 7 ways as a sum of consecutive naturals, for example, 12313962 + ... + 13995502.
It is an arithmetic number, because the mean of its divisors is an integer number (1650465422298).
Almost surely, 222120221202012 is an apocalyptic number.
It is an amenable number.
22120221202012 is a deficient number, since it is larger than the sum of its proper divisors (17490948933140).
22120221202012 is a wasteful number, since it uses less digits than its factorization.
22120221202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1758069 (or 1758067 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 22120221202012 its reverse (21020212202122), we get a palindrome (43140433404134).
The spelling of 22120221202012 in words is "twenty-two trillion, one hundred twenty billion, two hundred twenty-one million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •