Base | Representation |
---|---|
bin | 111100001101000… |
… | …0111001110000000 |
3 | 12012210012021122112 |
4 | 1320122013032000 |
5 | 13114122024412 |
6 | 532241554452 |
7 | 101026443056 |
oct | 17032071600 |
9 | 5183167575 |
10 | 2020111232 |
11 | 947333517 |
12 | 484645a28 |
13 | 2626992b9 |
14 | 1524121d6 |
15 | bc536722 |
hex | 78687380 |
2020111232 has 64 divisors (see below), whose sum is σ = 4176900000. Its totient is φ = 972023808.
The previous prime is 2020111213. The next prime is 2020111253. The reversal of 2020111232 is 2321110202.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1443269 + ... + 1444667.
Almost surely, 22020111232 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 2020111232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2088450000).
2020111232 is an abundant number, since it is smaller than the sum of its proper divisors (2156788768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020111232 is a wasteful number, since it uses less digits than its factorization.
2020111232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1831 (or 1819 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2020111232 is about 44945.6475312126. The cubic root of 2020111232 is about 1264.1300672649.
Adding to 2020111232 its reverse (2321110202), we get a palindrome (4341221434).
The spelling of 2020111232 in words is "two billion, twenty million, one hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •