Base | Representation |
---|---|
bin | 1001100110000110000000… |
… | …00010011001000000000111 |
3 | 2202201011001022222021120102 |
4 | 10303003000002121000013 |
5 | 10231201001402210434 |
6 | 112513130324554315 |
7 | 4305301115021441 |
oct | 463030002310007 |
9 | 82634038867512 |
10 | 21100101210119 |
11 | 67a5559066758 |
12 | 244941125299b |
13 | ba0967037549 |
14 | 52d370d4d491 |
15 | 268cde67a07e |
hex | 1330c0099007 |
21100101210119 has 8 divisors (see below), whose sum is σ = 21127318128000. Its totient is φ = 21072889217272.
The previous prime is 21100101210079. The next prime is 21100101210131. The reversal of 21100101210119 is 91101210100112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21100101210119 - 216 = 21100101144583 is a prime.
It is a super-2 number, since 2×211001012101192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21100101210119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100101270119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7381592 + ... + 9833010.
It is an arithmetic number, because the mean of its divisors is an integer number (2640914766000).
Almost surely, 221100101210119 is an apocalyptic number.
21100101210119 is a deficient number, since it is larger than the sum of its proper divisors (27216917881).
21100101210119 is a wasteful number, since it uses less digits than its factorization.
21100101210119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2462517.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 21100101210119 in words is "twenty-one trillion, one hundred billion, one hundred one million, two hundred ten thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •