Base | Representation |
---|---|
bin | 1001000110010111100011… |
… | …0101011100111101110101 |
3 | 1022102110200002010000112101 |
4 | 2101211320311130331311 |
5 | 2302410223031014311 |
6 | 33140123015222101 |
7 | 2051560243522006 |
oct | 221457065347565 |
9 | 38373602100471 |
10 | 10005006110581 |
11 | 3208110134a99 |
12 | 1157054377931 |
13 | 577611346531 |
14 | 26835dd411ad |
15 | 1253be6a4ec1 |
hex | 91978d5cf75 |
10005006110581 has 2 divisors, whose sum is σ = 10005006110582. Its totient is φ = 10005006110580.
The previous prime is 10005006110483. The next prime is 10005006110591. The reversal of 10005006110581 is 18501160050001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6441723183025 + 3563282927556 = 2538055^2 + 1887666^2 .
It is a cyclic number.
It is not a de Polignac number, because 10005006110581 - 213 = 10005006102389 is a prime.
It is a super-2 number, since 2×100050061105812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10005006110591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002503055290 + 5002503055291.
It is an arithmetic number, because the mean of its divisors is an integer number (5002503055291).
Almost surely, 210005006110581 is an apocalyptic number.
It is an amenable number.
10005006110581 is a deficient number, since it is larger than the sum of its proper divisors (1).
10005006110581 is an equidigital number, since it uses as much as digits as its factorization.
10005006110581 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 28.
Adding to 10005006110581 its reverse (18501160050001), we get a palindrome (28506166160582).
The spelling of 10005006110581 in words is "ten trillion, five billion, six million, one hundred ten thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •