Base | Representation |
---|---|
bin | 1001001111000001100010… |
… | …0001011011100101001001 |
3 | 1022221200111210102211110101 |
4 | 2103300120201123211021 |
5 | 2312324301302322044 |
6 | 33332315111445401 |
7 | 2065403333566063 |
oct | 223603041334511 |
9 | 38850453384411 |
10 | 10153714104649 |
11 | 32651909a5a45 |
12 | 117ba36386861 |
13 | 58865002952b |
14 | 271629c92733 |
15 | 1291c4b22cd4 |
hex | 93c1885b949 |
10153714104649 has 2 divisors, whose sum is σ = 10153714104650. Its totient is φ = 10153714104648.
The previous prime is 10153714104551. The next prime is 10153714104679. The reversal of 10153714104649 is 94640141735101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7674600874249 + 2479113230400 = 2770307^2 + 1574520^2 .
It is a cyclic number.
It is not a de Polignac number, because 10153714104649 - 213 = 10153714096457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10153714104599 and 10153714104608.
It is not a weakly prime, because it can be changed into another prime (10153714104679) 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, 5076857052324 + 5076857052325.
It is an arithmetic number, because the mean of its divisors is an integer number (5076857052325).
Almost surely, 210153714104649 is an apocalyptic number.
It is an amenable number.
10153714104649 is a deficient number, since it is larger than the sum of its proper divisors (1).
10153714104649 is an equidigital number, since it uses as much as digits as its factorization.
10153714104649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 10153714104649 in words is "ten trillion, one hundred fifty-three billion, seven hundred fourteen million, one hundred four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •