Base | Representation |
---|---|
bin | 1001000110011001011001… |
… | …0101010101000010111101 |
3 | 1022102111221120100022102211 |
4 | 2101212112111111002331 |
5 | 2302412231224143023 |
6 | 33140244054420421 |
7 | 2051605433205562 |
oct | 221462625250275 |
9 | 38374846308384 |
10 | 10005501006013 |
11 | 3208344525287 |
12 | 1157172061711 |
13 | 57768ca32076 |
14 | 2683a9968869 |
15 | 1253ecd60a0d |
hex | 919965550bd |
10005501006013 has 2 divisors, whose sum is σ = 10005501006014. Its totient is φ = 10005501006012.
The previous prime is 10005501005989. The next prime is 10005501006113. The reversal of 10005501006013 is 31060010550001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8780809077049 + 1224691928964 = 2963243^2 + 1106658^2 .
It is a cyclic number.
It is not a de Polignac number, because 10005501006013 - 221 = 10005498908861 is a prime.
It is a super-2 number, since 2×100055010060132 (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 (10005501006113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002750503006 + 5002750503007.
It is an arithmetic number, because the mean of its divisors is an integer number (5002750503007).
Almost surely, 210005501006013 is an apocalyptic number.
It is an amenable number.
10005501006013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10005501006013 is an equidigital number, since it uses as much as digits as its factorization.
10005501006013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 22.
Adding to 10005501006013 its reverse (31060010550001), we get a palindrome (41065511556014).
The spelling of 10005501006013 in words is "ten trillion, five billion, five hundred one million, six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •