Base | Representation |
---|---|
bin | 1001010011000000010100… |
… | …1111000100110000100110 |
3 | 1100012020001102101102110200 |
4 | 2110300011033010300212 |
5 | 2314434340130032324 |
6 | 33423550021131330 |
7 | 2103344262251205 |
oct | 224600517046046 |
9 | 40166042342420 |
10 | 10222110002214 |
11 | 3291199674120 |
12 | 1191143b59b46 |
13 | 591c30032a36 |
14 | 274a7782723c |
15 | 12ad794c3ec9 |
hex | 94c053c4c26 |
10222110002214 has 48 divisors (see below), whose sum is σ = 24337711204560. Its totient is φ = 3074998798080.
The previous prime is 10222110002213. The next prime is 10222110002243. The reversal of 10222110002214 is 41220001122201.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222110002213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 188391919 + ... + 188446170.
It is an arithmetic number, because the mean of its divisors is an integer number (507035650095).
Almost surely, 210222110002214 is an apocalyptic number.
10222110002214 is an abundant number, since it is smaller than the sum of its proper divisors (14115601202346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222110002214 is a wasteful number, since it uses less digits than its factorization.
10222110002214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376838245 (or 376838242 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10222110002214 its reverse (41220001122201), we get a palindrome (51442111124415).
The spelling of 10222110002214 in words is "ten trillion, two hundred twenty-two billion, one hundred ten million, two thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •