Base | Representation |
---|---|
bin | 1001001001110111011101… |
… | …01111111101101100110001 |
3 | 2122021102121210200202111011 |
4 | 10210323232233331230301 |
5 | 10114303143402044303 |
6 | 110451410233550521 |
7 | 4145234450222023 |
oct | 444735657755461 |
9 | 78242553622434 |
10 | 20130222299953 |
11 | 64611a7770437 |
12 | 2311456875441 |
13 | b3036c24caac |
14 | 4d8445072013 |
15 | 24d9774ab16d |
hex | 124eeebfdb31 |
20130222299953 has 2 divisors, whose sum is σ = 20130222299954. Its totient is φ = 20130222299952.
The previous prime is 20130222299911. The next prime is 20130222300091. The reversal of 20130222299953 is 35999222203102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18656931280689 + 1473291019264 = 4319367^2 + 1213792^2 .
It is a cyclic number.
It is not a de Polignac number, because 20130222299953 - 213 = 20130222291761 is a prime.
It is a super-3 number, since 3×201302222999533 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20130222299897 and 20130222299906.
It is not a weakly prime, because it can be changed into another prime (20130222299903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065111149976 + 10065111149977.
It is an arithmetic number, because the mean of its divisors is an integer number (10065111149977).
Almost surely, 220130222299953 is an apocalyptic number.
It is an amenable number.
20130222299953 is a deficient number, since it is larger than the sum of its proper divisors (1).
20130222299953 is an equidigital number, since it uses as much as digits as its factorization.
20130222299953 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1049760, while the sum is 49.
The spelling of 20130222299953 in words is "twenty trillion, one hundred thirty billion, two hundred twenty-two million, two hundred ninety-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •