Base | Representation |
---|---|
bin | 1001001001001110000100… |
… | …1100000011001011110011 |
3 | 1022121011010122120221101112 |
4 | 2102103201030003023303 |
5 | 2304211043341130021 |
6 | 33214424452423535 |
7 | 2055243346512362 |
oct | 222234114031363 |
9 | 38534118527345 |
10 | 10054001505011 |
11 | 3226972819002 |
12 | 1164648917bab |
13 | 57c11bc25999 |
14 | 26a88b0857d9 |
15 | 1267dac58d5b |
hex | 924e13032f3 |
10054001505011 has 2 divisors, whose sum is σ = 10054001505012. Its totient is φ = 10054001505010.
The previous prime is 10054001504977. The next prime is 10054001505017. The reversal of 10054001505011 is 11050510045001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10054001505011 - 214 = 10054001488627 is a prime.
It is a super-2 number, since 2×100540015050112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10054001505017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5027000752505 + 5027000752506.
It is an arithmetic number, because the mean of its divisors is an integer number (5027000752506).
Almost surely, 210054001505011 is an apocalyptic number.
10054001505011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10054001505011 is an equidigital number, since it uses as much as digits as its factorization.
10054001505011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 500, while the sum is 23.
The spelling of 10054001505011 in words is "ten trillion, fifty-four billion, one million, five hundred five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •