Base | Representation |
---|---|
bin | 10111010010001000110101… |
… | …111011101010001111100001 |
3 | 111102120111012122122222002222 |
4 | 113102020311323222033201 |
5 | 101410221300331300301 |
6 | 1001442335005520425 |
7 | 30366160001541656 |
oct | 2722106573521741 |
9 | 442514178588088 |
10 | 102401515103201 |
11 | 2a6a0269745866 |
12 | b59a124273115 |
13 | 451a562b98202 |
14 | 1b4038cb79c2d |
15 | bc8a721c531b |
hex | 5d2235eea3e1 |
102401515103201 has 2 divisors, whose sum is σ = 102401515103202. Its totient is φ = 102401515103200.
The previous prime is 102401515103197. The next prime is 102401515103243. The reversal of 102401515103201 is 102301515104201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95182970142976 + 7218544960225 = 9756176^2 + 2686735^2 .
It is a cyclic number.
It is not a de Polignac number, because 102401515103201 - 22 = 102401515103197 is a prime.
It is a super-2 number, since 2×1024015151032012 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (102401515103501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51200757551600 + 51200757551601.
It is an arithmetic number, because the mean of its divisors is an integer number (51200757551601).
Almost surely, 2102401515103201 is an apocalyptic number.
It is an amenable number.
102401515103201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102401515103201 is an equidigital number, since it uses as much as digits as its factorization.
102401515103201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 102401515103201 in words is "one hundred two trillion, four hundred one billion, five hundred fifteen million, one hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •