Base | Representation |
---|---|
bin | 1001100011110010110110… |
… | …10100101111110101101110 |
3 | 2202102121010202020021222120 |
4 | 10301321123110233311232 |
5 | 10223402204120041420 |
6 | 112412543324053410 |
7 | 4266503335535442 |
oct | 461713324576556 |
9 | 82377122207876 |
10 | 21021102112110 |
11 | 6774aaa13a101 |
12 | 2436044694266 |
13 | b96387397339 |
14 | 5295d90b8822 |
15 | 266c18eb9d40 |
hex | 131e5b52fd6e |
21021102112110 has 32 divisors (see below), whose sum is σ = 50564529175680. Its totient is φ = 5592973440288.
The previous prime is 21021102112099. The next prime is 21021102112111. The reversal of 21021102112110 is 1121120112012.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
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 21021102112110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21021102112111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 790848340 + ... + 790874919.
It is an arithmetic number, because the mean of its divisors is an integer number (1580141536740).
Almost surely, 221021102112110 is an apocalyptic number.
21021102112110 is an abundant number, since it is smaller than the sum of its proper divisors (29543427063570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21021102112110 is a wasteful number, since it uses less digits than its factorization.
21021102112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1581723712.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21021102112110 its reverse (1121120112012), we get a palindrome (22142222224122).
The spelling of 21021102112110 in words is "twenty-one trillion, twenty-one billion, one hundred two million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •