Base | Representation |
---|---|
bin | 101111110111111101000101… |
… | …111100011100010001000101 |
3 | 1000121111201000100100020111122 |
4 | 233313331011330130101011 |
5 | 210044201232414133013 |
6 | 2023450513121243325 |
7 | 62230656265533005 |
oct | 5767750574342105 |
9 | 1017451010306448 |
10 | 210553355224133 |
11 | 610a81a3a00419 |
12 | 1b746798793545 |
13 | 90641334813bc |
14 | 39dcba013a005 |
15 | 1951e98d1aa08 |
hex | bf7f45f1c445 |
210553355224133 has 2 divisors, whose sum is σ = 210553355224134. Its totient is φ = 210553355224132.
The previous prime is 210553355224129. The next prime is 210553355224139. The reversal of 210553355224133 is 331422553355012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 209911358469124 + 641996755009 = 14488318^2 + 801247^2 .
It is a cyclic number.
It is not a de Polignac number, because 210553355224133 - 22 = 210553355224129 is a prime.
It is a super-2 number, since 2×2105533552241332 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210553355224139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105276677612066 + 105276677612067.
It is an arithmetic number, because the mean of its divisors is an integer number (105276677612067).
Almost surely, 2210553355224133 is an apocalyptic number.
It is an amenable number.
210553355224133 is a deficient number, since it is larger than the sum of its proper divisors (1).
210553355224133 is an equidigital number, since it uses as much as digits as its factorization.
210553355224133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620000, while the sum is 44.
The spelling of 210553355224133 in words is "two hundred ten trillion, five hundred fifty-three billion, three hundred fifty-five million, two hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •