Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …1010000111000011111111 |
3 | 1100012000220012012011210210 |
4 | 2110232032022013003333 |
5 | 2314421242211242343 |
6 | 33423015453403503 |
7 | 2103243623312454 |
oct | 224561612070377 |
9 | 40160805164723 |
10 | 10220112212223 |
11 | 32903639a6a11 |
12 | 1190886a99593 |
13 | 5919a2180594 |
14 | 27492838582b |
15 | 12acaddeb333 |
hex | 94b8e2870ff |
10220112212223 has 32 divisors (see below), whose sum is σ = 14266253324736. Its totient is φ = 6500949331968.
The previous prime is 10220112212207. The next prime is 10220112212249. The reversal of 10220112212223 is 32221221102201.
It is not a de Polignac number, because 10220112212223 - 24 = 10220112212207 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10220112212223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220112212273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11435365 + ... + 12296657.
It is an arithmetic number, because the mean of its divisors is an integer number (445820416398).
Almost surely, 210220112212223 is an apocalyptic number.
10220112212223 is a deficient number, since it is larger than the sum of its proper divisors (4046141112513).
10220112212223 is a wasteful number, since it uses less digits than its factorization.
10220112212223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863403.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 10220112212223 its reverse (32221221102201), we get a palindrome (42441333314424).
The spelling of 10220112212223 in words is "ten trillion, two hundred twenty billion, one hundred twelve million, two hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •