Base | Representation |
---|---|
bin | 1001001001001101110100… |
… | …0000110100100010001001 |
3 | 1022121010221202202220111001 |
4 | 2102103131000310202021 |
5 | 2304210422422440203 |
6 | 33214413511135001 |
7 | 2055241536206662 |
oct | 222233500644211 |
9 | 38533852686431 |
10 | 10053931452553 |
11 | 322693722160a |
12 | 1164629374461 |
13 | 57c10a569321 |
14 | 26a881a4c369 |
15 | 1267d4a1c91d |
hex | 924dd034889 |
10053931452553 has 2 divisors, whose sum is σ = 10053931452554. Its totient is φ = 10053931452552.
The previous prime is 10053931452541. The next prime is 10053931452623. The reversal of 10053931452553 is 35525413935001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5564753614729 + 4489177837824 = 2358973^2 + 2118768^2 .
It is an emirp because it is prime and its reverse (35525413935001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10053931452553 - 229 = 10053394581641 is a prime.
It is not a weakly prime, because it can be changed into another prime (10053931452503) 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, 5026965726276 + 5026965726277.
It is an arithmetic number, because the mean of its divisors is an integer number (5026965726277).
Almost surely, 210053931452553 is an apocalyptic number.
It is an amenable number.
10053931452553 is a deficient number, since it is larger than the sum of its proper divisors (1).
10053931452553 is an equidigital number, since it uses as much as digits as its factorization.
10053931452553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1215000, while the sum is 46.
The spelling of 10053931452553 in words is "ten trillion, fifty-three billion, nine hundred thirty-one million, four hundred fifty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •