Base | Representation |
---|---|
bin | 1001100011100010000101… |
… | …10001001101110110111111 |
3 | 2202101201220101120021220211 |
4 | 10301301002301031312333 |
5 | 10223230240123210421 |
6 | 112404454154053251 |
7 | 4266034300613263 |
oct | 461610261156677 |
9 | 82351811507824 |
10 | 21012100210111 |
11 | 67711aa86997a |
12 | 2434351a1a227 |
13 | b955813cc3ca |
14 | 528dc372a0a3 |
15 | 26688da649e1 |
hex | 131c42c4ddbf |
21012100210111 has 8 divisors (see below), whose sum is σ = 21751760822400. Its totient is φ = 20273446626720.
The previous prime is 21012100210109. The next prime is 21012100210139. The reversal of 21012100210111 is 11101200121012.
It is a happy number.
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 21012100210111 - 21 = 21012100210109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21012100210091 and 21012100210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012100210141) 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, 251714760 + ... + 251798221.
It is an arithmetic number, because the mean of its divisors is an integer number (2718970102800).
Almost surely, 221012100210111 is an apocalyptic number.
21012100210111 is a deficient number, since it is larger than the sum of its proper divisors (739660612289).
21012100210111 is a wasteful number, since it uses less digits than its factorization.
21012100210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 503514449.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21012100210111 its reverse (11101200121012), we get a palindrome (32113300331123).
The spelling of 21012100210111 in words is "twenty-one trillion, twelve billion, one hundred million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •