Base | Representation |
---|---|
bin | 1001000110000101011001… |
… | …1000000011001010001101 |
3 | 1022102000002110111212022221 |
4 | 2101201112120003022031 |
5 | 2302320233022310221 |
6 | 33133555255535341 |
7 | 2051325422042605 |
oct | 221412630031215 |
9 | 38360073455287 |
10 | 10000133010061 |
11 | 320603a421497 |
12 | 115611438a551 |
13 | 5770158890bc |
14 | 26801aa73c05 |
15 | 1251d6968541 |
hex | 9185660328d |
10000133010061 has 2 divisors, whose sum is σ = 10000133010062. Its totient is φ = 10000133010060.
The previous prime is 10000133010059. The next prime is 10000133010137. The reversal of 10000133010061 is 16001033100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9867727994436 + 132405015625 = 3141294^2 + 363875^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000133010061 - 21 = 10000133010059 is a prime.
Together with 10000133010059, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000133070061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000066505030 + 5000066505031.
It is an arithmetic number, because the mean of its divisors is an integer number (5000066505031).
Almost surely, 210000133010061 is an apocalyptic number.
It is an amenable number.
10000133010061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000133010061 is an equidigital number, since it uses as much as digits as its factorization.
10000133010061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10000133010061 its reverse (16001033100001), we get a palindrome (26001166110062).
The spelling of 10000133010061 in words is "ten trillion, one hundred thirty-three million, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •