Base | Representation |
---|---|
bin | 1001100110011100011000… |
… | …11110010000100001111110 |
3 | 2202202022002000022222102120 |
4 | 10303032030132100201332 |
5 | 10231400110434031420 |
6 | 112522435142503410 |
7 | 4306205016406665 |
oct | 463161436204176 |
9 | 82668060288376 |
10 | 21112121002110 |
11 | 67aa666a06346 |
12 | 244b806734b66 |
13 | ba1b3130b8b8 |
14 | 52db9143dddc |
15 | 269294a09d40 |
hex | 13338c79087e |
21112121002110 has 32 divisors (see below), whose sum is σ = 50701425610752. Its totient is φ = 5626306133280.
The previous prime is 21112121002103. The next prime is 21112121002139. The reversal of 21112121002110 is 1120012121112.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 21112121002110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224502246 + ... + 224596265.
It is an arithmetic number, because the mean of its divisors is an integer number (1584419550336).
Almost surely, 221112121002110 is an apocalyptic number.
21112121002110 is an abundant number, since it is smaller than the sum of its proper divisors (29589304608642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112121002110 is a wasteful number, since it uses less digits than its factorization.
21112121002110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 449100088.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21112121002110 its reverse (1120012121112), we get a palindrome (22232133123222).
It can be divided in two parts, 21112121002 and 110, that added together give a palindrome (21112121112).
The spelling of 21112121002110 in words is "twenty-one trillion, one hundred twelve billion, one hundred twenty-one million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •