Base | Representation |
---|---|
bin | 1001000110101010100111… |
… | …0001100001011001110011 |
3 | 1022102221212121210210021022 |
4 | 2101222221301201121303 |
5 | 2303001212231143214 |
6 | 33142330413250055 |
7 | 2052131105134421 |
oct | 221525161413163 |
9 | 38387777723238 |
10 | 10010122131059 |
11 | 320a2a5a85996 |
12 | 115804179392b |
13 | 577c4823789b |
14 | 2686c75a4111 |
15 | 1255bd8c7d8e |
hex | 91aa9c61673 |
10010122131059 has 2 divisors, whose sum is σ = 10010122131060. Its totient is φ = 10010122131058.
The previous prime is 10010122131001. The next prime is 10010122131101. The reversal of 10010122131059 is 95013122101001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10010122131059 is a prime.
It is a super-2 number, since 2×100101221310592 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10010122131259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005061065529 + 5005061065530.
It is an arithmetic number, because the mean of its divisors is an integer number (5005061065530).
Almost surely, 210010122131059 is an apocalyptic number.
10010122131059 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010122131059 is an equidigital number, since it uses as much as digits as its factorization.
10010122131059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 26.
The spelling of 10010122131059 in words is "ten trillion, ten billion, one hundred twenty-two million, one hundred thirty-one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •