Base | Representation |
---|---|
bin | 1001010010000110011101… |
… | …1010010000100011010001 |
3 | 1100010201221220201221112222 |
4 | 2110201213122100203101 |
5 | 2314211032232411311 |
6 | 33412500432030425 |
7 | 2102254333011116 |
oct | 224414732204321 |
9 | 40121856657488 |
10 | 10206577232081 |
11 | 328564884300a |
12 | 118a12a092415 |
13 | 590625cc9aa9 |
14 | 27400295a90d |
15 | 12a76aa21adb |
hex | 948676908d1 |
10206577232081 has 2 divisors, whose sum is σ = 10206577232082. Its totient is φ = 10206577232080.
The previous prime is 10206577232029. The next prime is 10206577232161. The reversal of 10206577232081 is 18023277560201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7079904534481 + 3126672697600 = 2660809^2 + 1768240^2 .
It is a cyclic number.
It is not a de Polignac number, because 10206577232081 - 234 = 10189397362897 is a prime.
It is a super-3 number, since 3×102065772320813 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 (10206577232881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5103288616040 + 5103288616041.
It is an arithmetic number, because the mean of its divisors is an integer number (5103288616041).
Almost surely, 210206577232081 is an apocalyptic number.
It is an amenable number.
10206577232081 is a deficient number, since it is larger than the sum of its proper divisors (1).
10206577232081 is an equidigital number, since it uses as much as digits as its factorization.
10206577232081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 282240, while the sum is 44.
The spelling of 10206577232081 in words is "ten trillion, two hundred six billion, five hundred seventy-seven million, two hundred thirty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •