Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …0111000000110010110011 |
3 | 1022102002121112220122202002 |
4 | 2101202100213000302303 |
5 | 2302324233130323214 |
6 | 33134240240244215 |
7 | 2051361554314166 |
oct | 221422047006263 |
9 | 38362545818662 |
10 | 10001110011059 |
11 | 32064a0966832 |
12 | 115634761066b |
13 | 577140102abb |
14 | 2680b0715add |
15 | 1252426051de |
hex | 918909c0cb3 |
10001110011059 has 2 divisors, whose sum is σ = 10001110011060. Its totient is φ = 10001110011058.
The previous prime is 10001110011049. The next prime is 10001110011157. The reversal of 10001110011059 is 95011001110001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10001110011059 - 212 = 10001110006963 is a prime.
It is a super-2 number, since 2×100011100110592 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10001110011059.
It is not a weakly prime, because it can be changed into another prime (10001110011019) 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, 5000555005529 + 5000555005530.
It is an arithmetic number, because the mean of its divisors is an integer number (5000555005530).
Almost surely, 210001110011059 is an apocalyptic number.
10001110011059 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001110011059 is an equidigital number, since it uses as much as digits as its factorization.
10001110011059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 20.
The spelling of 10001110011059 in words is "ten trillion, one billion, one hundred ten million, eleven thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.989 sec. • engine limits •