Base | Representation |
---|---|
bin | 10111001101110001000011… |
… | …110111010000101101100101 |
3 | 111101111202210021202102122221 |
4 | 113031301003313100231211 |
5 | 101340311023341322412 |
6 | 1001052333123352341 |
7 | 30335363316036253 |
oct | 2715610367205545 |
9 | 441452707672587 |
10 | 102101101120357 |
11 | 2a5949198a3089 |
12 | b54ba642226b1 |
13 | 44c8128370651 |
14 | 1b2da10a735d3 |
15 | bc0d3d4deb07 |
hex | 5cdc43dd0b65 |
102101101120357 has 2 divisors, whose sum is σ = 102101101120358. Its totient is φ = 102101101120356.
The previous prime is 102101101120219. The next prime is 102101101120367. The reversal of 102101101120357 is 753021101101201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85433159916036 + 16667941204321 = 9243006^2 + 4082639^2 .
It is a cyclic number.
It is not a de Polignac number, because 102101101120357 - 227 = 102100966902629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102101101120367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050550560178 + 51050550560179.
It is an arithmetic number, because the mean of its divisors is an integer number (51050550560179).
Almost surely, 2102101101120357 is an apocalyptic number.
It is an amenable number.
102101101120357 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101101120357 is an equidigital number, since it uses as much as digits as its factorization.
102101101120357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 25.
Adding to 102101101120357 its reverse (753021101101201), we get a palindrome (855122202221558).
The spelling of 102101101120357 in words is "one hundred two trillion, one hundred one billion, one hundred one million, one hundred twenty thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •