Base | Representation |
---|---|
bin | 10010101111010000… |
… | …001000100010000000 |
3 | 1220221012112112212220 |
4 | 102233100020202000 |
5 | 312201222024412 |
6 | 13124255451040 |
7 | 1311411060264 |
oct | 225720104200 |
9 | 56835475786 |
10 | 20120111232 |
11 | 8595307401 |
12 | 3a96226a80 |
13 | 1b88540380 |
14 | d8c2300a4 |
15 | 7cb59468c |
hex | 4af408880 |
20120111232 has 128 divisors (see below), whose sum is σ = 57634536960. Its totient is φ = 6182264832.
The previous prime is 20120111227. The next prime is 20120111243. The reversal of 20120111232 is 23211102102.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4275793 + ... + 4280495.
It is an arithmetic number, because the mean of its divisors is an integer number (450269820).
Almost surely, 220120111232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20120111232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28817268480).
20120111232 is an abundant number, since it is smaller than the sum of its proper divisors (37514425728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20120111232 is a wasteful number, since it uses less digits than its factorization.
20120111232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5590 (or 5578 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20120111232 its reverse (23211102102), we get a palindrome (43331213334).
The spelling of 20120111232 in words is "twenty billion, one hundred twenty million, one hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •