Base | Representation |
---|---|
bin | 101111011111110111… |
… | …1011011111000001001 |
3 | 100202021122010022221022 |
4 | 1132333233123320021 |
5 | 3132344242143032 |
6 | 114505250122225 |
7 | 10240453210502 |
oct | 1367757337011 |
9 | 322248108838 |
10 | 102001131017 |
11 | 3a292a85495 |
12 | 17927b80375 |
13 | 9807291836 |
14 | 4d18b31ba9 |
15 | 29bec72512 |
hex | 17bfbdbe09 |
102001131017 has 2 divisors, whose sum is σ = 102001131018. Its totient is φ = 102001131016.
The previous prime is 102001130941. The next prime is 102001131091. The reversal of 102001131017 is 710131100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85909954816 + 16091176201 = 293104^2 + 126851^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001131017 - 220 = 102000082441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102001130986 and 102001131004.
It is not a weakly prime, because it can be changed into another prime (102001131217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000565508 + 51000565509.
It is an arithmetic number, because the mean of its divisors is an integer number (51000565509).
Almost surely, 2102001131017 is an apocalyptic number.
It is an amenable number.
102001131017 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001131017 is an equidigital number, since it uses as much as digits as its factorization.
102001131017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 17.
Adding to 102001131017 its reverse (710131100201), we get a palindrome (812132231218).
The spelling of 102001131017 in words is "one hundred two billion, one million, one hundred thirty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •