Base | Representation |
---|---|
bin | 1001010010101011110101… |
… | …11100100110000110111000 |
3 | 2200100101201101100001101112 |
4 | 10221111322330212012320 |
5 | 10134234214331212102 |
6 | 111242520451535452 |
7 | 4206152202261014 |
oct | 451257274460670 |
9 | 80311641301345 |
10 | 20433222132152 |
11 | 6568754222aa5 |
12 | 23601188ba588 |
13 | b52ac970472b |
14 | 508d8a775544 |
15 | 2567ad1c9252 |
hex | 12957af261b8 |
20433222132152 has 8 divisors (see below), whose sum is σ = 38312291497800. Its totient is φ = 10216611066072.
The previous prime is 20433222132133. The next prime is 20433222132163. The reversal of 20433222132152 is 25123122233402.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×204332221321522 (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 as a sum of consecutive naturals, namely, 1277076383252 + ... + 1277076383267.
It is an arithmetic number, because the mean of its divisors is an integer number (4789036437225).
Almost surely, 220433222132152 is an apocalyptic number.
It is an amenable number.
20433222132152 is a deficient number, since it is larger than the sum of its proper divisors (17879069365648).
20433222132152 is a wasteful number, since it uses less digits than its factorization.
20433222132152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2554152766525 (or 2554152766521 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 20433222132152 its reverse (25123122233402), we get a palindrome (45556344365554).
The spelling of 20433222132152 in words is "twenty trillion, four hundred thirty-three billion, two hundred twenty-two million, one hundred thirty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •