Base | Representation |
---|---|
bin | 1001010011000000010100… |
… | …1111011111100111011111 |
3 | 1100012020001102121000101002 |
4 | 2110300011033133213133 |
5 | 2314434340142042343 |
6 | 33423550023340515 |
7 | 2103344263220012 |
oct | 224600517374737 |
9 | 40166042530332 |
10 | 10222110112223 |
11 | 3291199739839 |
12 | 1191143bb173b |
13 | 591c30070b29 |
14 | 274a77855379 |
15 | 12ad794e68b8 |
hex | 94c053df9df |
10222110112223 has 4 divisors (see below), whose sum is σ = 10395366215880. Its totient is φ = 10048854008568.
The previous prime is 10222110112211. The next prime is 10222110112327. The reversal of 10222110112223 is 32221101122201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10222110112223 - 214 = 10222110095839 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10222110112195 and 10222110112204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222110172223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 86628051740 + ... + 86628051857.
It is an arithmetic number, because the mean of its divisors is an integer number (2598841553970).
Almost surely, 210222110112223 is an apocalyptic number.
10222110112223 is a deficient number, since it is larger than the sum of its proper divisors (173256103657).
10222110112223 is an equidigital number, since it uses as much as digits as its factorization.
10222110112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173256103656.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10222110112223 its reverse (32221101122201), we get a palindrome (42443211234424).
The spelling of 10222110112223 in words is "ten trillion, two hundred twenty-two billion, one hundred ten million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •