Base | Representation |
---|---|
bin | 1001101001010010111001… |
… | …00110100001100000001110 |
3 | 2210002122222111001222122122 |
4 | 10310221130212201200032 |
5 | 10240001242120011342 |
6 | 113035441510012542 |
7 | 4316244050161214 |
oct | 464513446414016 |
9 | 83078874058578 |
10 | 21210102110222 |
11 | 6838176771053 |
12 | 24667b0347152 |
13 | bab14778b04c |
14 | 5348082c8cb4 |
15 | 26bacb89e4d2 |
hex | 134a5c9a180e |
21210102110222 has 8 divisors (see below), whose sum is σ = 31839835212000. Its totient is φ = 10596823706224.
The previous prime is 21210102110213. The next prime is 21210102110227. The reversal of 21210102110222 is 22201120101212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 21210102110222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210102110227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4113671222 + ... + 4113676377.
It is an arithmetic number, because the mean of its divisors is an integer number (3979979401500).
Almost surely, 221210102110222 is an apocalyptic number.
21210102110222 is a deficient number, since it is larger than the sum of its proper divisors (10629733101778).
21210102110222 is a wasteful number, since it uses less digits than its factorization.
21210102110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8227348890.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21210102110222 its reverse (22201120101212), we get a palindrome (43411222211434).
The spelling of 21210102110222 in words is "twenty-one trillion, two hundred ten billion, one hundred two million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •