Base | Representation |
---|---|
bin | 1001000111100010001100… |
… | …0010011000011111010001 |
3 | 1022111101101101020001110211 |
4 | 2101320203002120133101 |
5 | 2303222241110333032 |
6 | 33153235051124121 |
7 | 2053166605504312 |
oct | 221704302303721 |
9 | 38441341201424 |
10 | 10025041496017 |
11 | 3215661632679 |
12 | 115ab06143641 |
13 | 5794851604a2 |
14 | 269300bd8609 |
15 | 125b935b0747 |
hex | 91e230987d1 |
10025041496017 has 2 divisors, whose sum is σ = 10025041496018. Its totient is φ = 10025041496016.
The previous prime is 10025041496011. The next prime is 10025041496023. The reversal of 10025041496017 is 71069414052001.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (10025041496011) and next prime (10025041496023).
It can be written as a sum of positive squares in only one way, i.e., 7284811523521 + 2740229972496 = 2699039^2 + 1655364^2 .
It is a cyclic number.
It is not a de Polignac number, because 10025041496017 - 239 = 9475285682129 is a prime.
It is not a weakly prime, because it can be changed into another prime (10025041496011) 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, 5012520748008 + 5012520748009.
It is an arithmetic number, because the mean of its divisors is an integer number (5012520748009).
Almost surely, 210025041496017 is an apocalyptic number.
It is an amenable number.
10025041496017 is a deficient number, since it is larger than the sum of its proper divisors (1).
10025041496017 is an equidigital number, since it uses as much as digits as its factorization.
10025041496017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 40.
The spelling of 10025041496017 in words is "ten trillion, twenty-five billion, forty-one million, four hundred ninety-six thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •