Base | Representation |
---|---|
bin | 10110110000101100011000… |
… | …011001001101100100101101 |
3 | 111010102202212221221220200212 |
4 | 112300230120121031210231 |
5 | 101110042334234432003 |
6 | 552522440350432205 |
7 | 30041134625004365 |
oct | 2660543031154455 |
9 | 433382787856625 |
10 | 100103212030253 |
11 | 29994596562133 |
12 | b28880b202665 |
13 | 43b1900246bb3 |
14 | 1aa10426ad9a5 |
15 | b88daa9d1dd8 |
hex | 5b0b1864d92d |
100103212030253 has 2 divisors, whose sum is σ = 100103212030254. Its totient is φ = 100103212030252.
The previous prime is 100103212030193. The next prime is 100103212030267. The reversal of 100103212030253 is 352030212301001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59808367886569 + 40294844143684 = 7733587^2 + 6347822^2 .
It is a cyclic number.
It is not a de Polignac number, because 100103212030253 - 210 = 100103212029229 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100103212030453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051606015126 + 50051606015127.
It is an arithmetic number, because the mean of its divisors is an integer number (50051606015127).
Almost surely, 2100103212030253 is an apocalyptic number.
It is an amenable number.
100103212030253 is a deficient number, since it is larger than the sum of its proper divisors (1).
100103212030253 is an equidigital number, since it uses as much as digits as its factorization.
100103212030253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 100103212030253 its reverse (352030212301001), we get a palindrome (452133424331254).
The spelling of 100103212030253 in words is "one hundred trillion, one hundred three billion, two hundred twelve million, thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •