Base | Representation |
---|---|
bin | 1001001001001110011100… |
… | …1001100011100001011101 |
3 | 1022121011101121202221101111 |
4 | 2102103213021203201131 |
5 | 2304211244441424313 |
6 | 33214442424142021 |
7 | 2055246002543632 |
oct | 222234711434135 |
9 | 38534347687344 |
10 | 10054101514333 |
11 | 3226a14216538 |
12 | 1164676307911 |
13 | 57c1368707b6 |
14 | 26a89a47a189 |
15 | 1267e491143d |
hex | 924e726385d |
10054101514333 has 2 divisors, whose sum is σ = 10054101514334. Its totient is φ = 10054101514332.
The previous prime is 10054101514307. The next prime is 10054101514339. The reversal of 10054101514333 is 33341510145001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5822120190649 + 4231981323684 = 2412907^2 + 2057178^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10054101514333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10054101514295 and 10054101514304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10054101514339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5027050757166 + 5027050757167.
It is an arithmetic number, because the mean of its divisors is an integer number (5027050757167).
Almost surely, 210054101514333 is an apocalyptic number.
It is an amenable number.
10054101514333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10054101514333 is an equidigital number, since it uses as much as digits as its factorization.
10054101514333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 10054101514333 its reverse (33341510145001), we get a palindrome (43395611659334).
The spelling of 10054101514333 in words is "ten trillion, fifty-four billion, one hundred one million, five hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •