Base | Representation |
---|---|
bin | 101111100000010100… |
… | …0111010111101101101 |
3 | 100202022200110221110102 |
4 | 1133000220322331231 |
5 | 3132412121404212 |
6 | 114510545120445 |
7 | 10241025253145 |
oct | 1370050727555 |
9 | 322280427412 |
10 | 102016200557 |
11 | 3a2a0538457 |
12 | 17931029125 |
13 | 980a439a1b |
14 | 4d1ab35925 |
15 | 29c124c5c2 |
hex | 17c0a3af6d |
102016200557 has 2 divisors, whose sum is σ = 102016200558. Its totient is φ = 102016200556.
The previous prime is 102016200523. The next prime is 102016200593. The reversal of 102016200557 is 755002610201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52230988681 + 49785211876 = 228541^2 + 223126^2 .
It is a cyclic number.
It is not a de Polignac number, because 102016200557 - 230 = 100942458733 is a prime.
It is a super-2 number, since 2×1020162005572 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102016200157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51008100278 + 51008100279.
It is an arithmetic number, because the mean of its divisors is an integer number (51008100279).
Almost surely, 2102016200557 is an apocalyptic number.
It is an amenable number.
102016200557 is a deficient number, since it is larger than the sum of its proper divisors (1).
102016200557 is an equidigital number, since it uses as much as digits as its factorization.
102016200557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 29.
Adding to 102016200557 its reverse (755002610201), we get a palindrome (857018810758).
The spelling of 102016200557 in words is "one hundred two billion, sixteen million, two hundred thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •