Base | Representation |
---|---|
bin | 101101101110100011010100… |
… | …010001011001110110010101 |
3 | 222101002000221001010022012102 |
4 | 231232203110101121312111 |
5 | 202330001023130000041 |
6 | 1551421100220531445 |
7 | 60234540533426624 |
oct | 5556432421316625 |
9 | 871060831108172 |
10 | 201111110000021 |
11 | 59097819703841 |
12 | 1a68081b9b0b85 |
13 | 882a9089c6b60 |
14 | 3793b888336bb |
15 | 183b5650ac09b |
hex | b6e8d4459d95 |
201111110000021 has 64 divisors (see below), whose sum is σ = 238844728442880. Its totient is φ = 167670112389120.
The previous prime is 201111109999997. The next prime is 201111110000033. The reversal of 201111110000021 is 120000011111102.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201111110000021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201111109999957 and 201111110000011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201111110000081) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 223894220 + ... + 224790666.
It is an arithmetic number, because the mean of its divisors is an integer number (3731948881920).
Almost surely, 2201111110000021 is an apocalyptic number.
It is an amenable number.
201111110000021 is a deficient number, since it is larger than the sum of its proper divisors (37733618442859).
201111110000021 is a wasteful number, since it uses less digits than its factorization.
201111110000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896946.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201111110000021 its reverse (120000011111102), we get a palindrome (321111121111123).
The spelling of 201111110000021 in words is "two hundred one trillion, one hundred eleven billion, one hundred ten million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •