Base | Representation |
---|---|
bin | 1001000111010100010010… |
… | …1100000110010000101001 |
3 | 1022111000202101211220221110 |
4 | 2101311010230012100221 |
5 | 2303142121121042413 |
6 | 33151420552100533 |
7 | 2053005300662661 |
oct | 221650454062051 |
9 | 38430671756843 |
10 | 10021311112233 |
11 | 3214017960073 |
12 | 115a244994749 |
13 | 57900c35bcc5 |
14 | 2690695c91a1 |
15 | 125a25d468c3 |
hex | 91d44b06429 |
10021311112233 has 8 divisors (see below), whose sum is σ = 13362120995296. Its totient is φ = 6680687652000.
The previous prime is 10021311112231. The next prime is 10021311112237. The reversal of 10021311112233 is 33221111312001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10021311112233 - 21 = 10021311112231 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10021311112231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46480228 + ... + 46695333.
It is an arithmetic number, because the mean of its divisors is an integer number (1670265124412).
Almost surely, 210021311112233 is an apocalyptic number.
It is an amenable number.
10021311112233 is a deficient number, since it is larger than the sum of its proper divisors (3340809883063).
10021311112233 is an equidigital number, since it uses as much as digits as its factorization.
10021311112233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93211415.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10021311112233 its reverse (33221111312001), we get a palindrome (43242422424234).
The spelling of 10021311112233 in words is "ten trillion, twenty-one billion, three hundred eleven million, one hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •