Base | Representation |
---|---|
bin | 10111001110100000111100… |
… | …000101000011010101010101 |
3 | 111101200200111001212110211122 |
4 | 113032200330011003111111 |
5 | 101342131320043003042 |
6 | 1001132114301013325 |
7 | 30342163300261364 |
oct | 2716407405032525 |
9 | 441620431773748 |
10 | 102152510125397 |
11 | 2a6046aa945506 |
12 | b559a10b54245 |
13 | 44ccc2bcc2864 |
14 | 1b322ca57b7db |
15 | bc234b9077d2 |
hex | 5ce83c143555 |
102152510125397 has 2 divisors, whose sum is σ = 102152510125398. Its totient is φ = 102152510125396.
The previous prime is 102152510125339. The next prime is 102152510125423. The reversal of 102152510125397 is 793521015251201.
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., 100743657448996 + 1408852676401 = 10037114^2 + 1186951^2 .
It is a cyclic number.
It is not a de Polignac number, because 102152510125397 - 224 = 102152493348181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102152510125097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51076255062698 + 51076255062699.
It is an arithmetic number, because the mean of its divisors is an integer number (51076255062699).
Almost surely, 2102152510125397 is an apocalyptic number.
It is an amenable number.
102152510125397 is a deficient number, since it is larger than the sum of its proper divisors (1).
102152510125397 is an equidigital number, since it uses as much as digits as its factorization.
102152510125397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 189000, while the sum is 44.
Adding to 102152510125397 its reverse (793521015251201), we get a palindrome (895673525376598).
The spelling of 102152510125397 in words is "one hundred two trillion, one hundred fifty-two billion, five hundred ten million, one hundred twenty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •