Base | Representation |
---|---|
bin | 1001000111010111001110… |
… | …1101111001001101111101 |
3 | 1022111002210101111021111102 |
4 | 2101311303231321031331 |
5 | 2303200230112043003 |
6 | 33152031135102445 |
7 | 2053033661243405 |
oct | 221656355711575 |
9 | 38432711437442 |
10 | 10022100112253 |
11 | 32143922684a9 |
12 | 115a425071a25 |
13 | 579106960118 |
14 | 2691022cd805 |
15 | 125a70249588 |
hex | 91d73b7937d |
10022100112253 has 2 divisors, whose sum is σ = 10022100112254. Its totient is φ = 10022100112252.
The previous prime is 10022100112183. The next prime is 10022100112261. The reversal of 10022100112253 is 35221100122001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9912435153604 + 109664958649 = 3148402^2 + 331157^2 .
It is an emirp because it is prime and its reverse (35221100122001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10022100112253 - 218 = 10022099850109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10022100142253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011050056126 + 5011050056127.
It is an arithmetic number, because the mean of its divisors is an integer number (5011050056127).
Almost surely, 210022100112253 is an apocalyptic number.
It is an amenable number.
10022100112253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022100112253 is an equidigital number, since it uses as much as digits as its factorization.
10022100112253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 10022100112253 its reverse (35221100122001), we get a palindrome (45243200234254).
The spelling of 10022100112253 in words is "ten trillion, twenty-two billion, one hundred million, one hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •