Base | Representation |
---|---|
bin | 1001100110000110000011… |
… | …10001000011110010100110 |
3 | 2202201011010100120012022201 |
4 | 10303003001301003302212 |
5 | 10231201031314034342 |
6 | 112513133242445114 |
7 | 4305301616431063 |
oct | 463030161036246 |
9 | 82634110505281 |
10 | 21100130221222 |
11 | 67a5573481178 |
12 | 244941ab0379a |
13 | ba0970054390 |
14 | 52d374b41c6a |
15 | 268ce1eaadb7 |
hex | 1330c1c43ca6 |
21100130221222 has 16 divisors (see below), whose sum is σ = 35878763939760. Its totient is φ = 9225967869792.
The previous prime is 21100130221199. The next prime is 21100130221223. The reversal of 21100130221222 is 22212203100112.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 21100130221222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100130221223) 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 7 ways as a sum of consecutive naturals, for example, 21356406613 + ... + 21356407600.
It is an arithmetic number, because the mean of its divisors is an integer number (2242422746235).
Almost surely, 221100130221222 is an apocalyptic number.
21100130221222 is a deficient number, since it is larger than the sum of its proper divisors (14778633718538).
21100130221222 is a wasteful number, since it uses less digits than its factorization.
21100130221222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42712814247.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 21100130221222 its reverse (22212203100112), we get a palindrome (43312333321334).
The spelling of 21100130221222 in words is "twenty-one trillion, one hundred billion, one hundred thirty million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •