Base | Representation |
---|---|
bin | 101111110101000100… |
… | …1100011010010111000 |
3 | 100211010012220201122010 |
4 | 1133222021203102320 |
5 | 3140323412321331 |
6 | 115104023525520 |
7 | 10264212603153 |
oct | 1375211432270 |
9 | 324105821563 |
10 | 102712620216 |
11 | 3a618661898 |
12 | 17aa62b98a0 |
13 | 98bb7c456b |
14 | 4d8541ac9a |
15 | 2a12463e46 |
hex | 17ea2634b8 |
102712620216 has 32 divisors (see below), whose sum is σ = 257071098240. Its totient is φ = 34198933728.
The previous prime is 102712620211. The next prime is 102712620221. The reversal of 102712620216 is 612026217201.
It is an interprime number because it is at equal distance from previous prime (102712620211) and next prime (102712620221).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102712620211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2391166 + ... + 2433741.
It is an arithmetic number, because the mean of its divisors is an integer number (8033471820).
Almost surely, 2102712620216 is an apocalyptic number.
It is an amenable number.
102712620216 is an abundant number, since it is smaller than the sum of its proper divisors (154358478024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102712620216 is a wasteful number, since it uses less digits than its factorization.
102712620216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4825803 (or 4825799 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
Adding to 102712620216 its reverse (612026217201), we get a palindrome (714738837417).
The spelling of 102712620216 in words is "one hundred two billion, seven hundred twelve million, six hundred twenty thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •