Base | Representation |
---|---|
bin | 101111101010010101… |
… | …1101011010000011001 |
3 | 100210012010020001020222 |
4 | 1133110223223100121 |
5 | 3134104212420334 |
6 | 115004200325425 |
7 | 10252250420534 |
oct | 1372453532031 |
9 | 323163201228 |
10 | 102352466969 |
11 | 3a453332385 |
12 | 17a05773875 |
13 | 9861cc4b2c |
14 | 4d4d669a1b |
15 | 29e0a21d2e |
hex | 17d4aeb419 |
102352466969 has 2 divisors, whose sum is σ = 102352466970. Its totient is φ = 102352466968.
The previous prime is 102352466939. The next prime is 102352466971. The reversal of 102352466969 is 969664253201.
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., 102275238025 + 77228944 = 319805^2 + 8788^2 .
It is a cyclic number.
It is not a de Polignac number, because 102352466969 - 236 = 33632990233 is a prime.
It is a super-2 number, since 2×1023524669692 (a number of 23 digits) contains 22 as substring.
Together with 102352466971, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102352466969.
It is not a weakly prime, because it can be changed into another prime (102352466939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51176233484 + 51176233485.
It is an arithmetic number, because the mean of its divisors is an integer number (51176233485).
Almost surely, 2102352466969 is an apocalyptic number.
It is an amenable number.
102352466969 is a deficient number, since it is larger than the sum of its proper divisors (1).
102352466969 is an equidigital number, since it uses as much as digits as its factorization.
102352466969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4199040, while the sum is 53.
The spelling of 102352466969 in words is "one hundred two billion, three hundred fifty-two million, four hundred sixty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •