Base | Representation |
---|---|
bin | 1001010011000100000110… |
… | …0101000100101101010101 |
3 | 1100012022122222101200001222 |
4 | 2110301001211010231111 |
5 | 2314443423313332013 |
6 | 33424234304300125 |
7 | 2103411334435364 |
oct | 224610145045525 |
9 | 40168588350058 |
10 | 10223122402133 |
11 | 3291669097173 |
12 | 1191387011645 |
13 | 5920619c1c44 |
14 | 274b320817db |
15 | 12add8304508 |
hex | 94c41944b55 |
10223122402133 has 2 divisors, whose sum is σ = 10223122402134. Its totient is φ = 10223122402132.
The previous prime is 10223122402099. The next prime is 10223122402177. The reversal of 10223122402133 is 33120422132201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5905711647889 + 4317410754244 = 2430167^2 + 2077838^2 .
It is an emirp because it is prime and its reverse (33120422132201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10223122402133 - 26 = 10223122402069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10223127402133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111561201066 + 5111561201067.
It is an arithmetic number, because the mean of its divisors is an integer number (5111561201067).
Almost surely, 210223122402133 is an apocalyptic number.
It is an amenable number.
10223122402133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10223122402133 is an equidigital number, since it uses as much as digits as its factorization.
10223122402133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 10223122402133 its reverse (33120422132201), we get a palindrome (43343544534334).
The spelling of 10223122402133 in words is "ten trillion, two hundred twenty-three billion, one hundred twenty-two million, four hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •