Base | Representation |
---|---|
bin | 1001000111000001000100… |
… | …10000011101111111000010 |
3 | 2121221001212120202211211022 |
4 | 10203200202100131333002 |
5 | 10111202123331223020 |
6 | 110334413530345442 |
7 | 4135200060211115 |
oct | 443404220357702 |
9 | 77831776684738 |
10 | 20032302211010 |
11 | 64237193a22a1 |
12 | 22b648958b282 |
13 | b2406561646b |
14 | 4d37d634c57c |
15 | 24b145b6b625 |
hex | 12382241dfc2 |
20032302211010 has 32 divisors (see below), whose sum is σ = 36213693010560. Its totient is φ = 7978355941248.
The previous prime is 20032302211007. The next prime is 20032302211067. The reversal of 20032302211010 is 1011220323002.
It is a super-2 number, since 2×200323022110102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20032302211010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 181365581 + ... + 181475999.
It is an arithmetic number, because the mean of its divisors is an integer number (1131677906580).
Almost surely, 220032302211010 is an apocalyptic number.
20032302211010 is a deficient number, since it is larger than the sum of its proper divisors (16181390799550).
20032302211010 is a wasteful number, since it uses less digits than its factorization.
20032302211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188522.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20032302211010 its reverse (1011220323002), we get a palindrome (21043522534012).
The spelling of 20032302211010 in words is "twenty trillion, thirty-two billion, three hundred two million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •