Base | Representation |
---|---|
bin | 1001001101011000000110… |
… | …0001101001100001111001 |
3 | 1022211222110022011001200201 |
4 | 2103112001201221201321 |
5 | 2311343320203422033 |
6 | 33311314414002201 |
7 | 2063352060264235 |
oct | 223260141514171 |
9 | 38758408131621 |
10 | 10125410998393 |
11 | 32541875a3339 |
12 | 11764577a6361 |
13 | 585a8c393b92 |
14 | 270102d615c5 |
15 | 1285b9e8747d |
hex | 93581869879 |
10125410998393 has 2 divisors, whose sum is σ = 10125410998394. Its totient is φ = 10125410998392.
The previous prime is 10125410998369. The next prime is 10125410998411. The reversal of 10125410998393 is 39389901452101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6728644045369 + 3396766953024 = 2593963^2 + 1843032^2 .
It is an emirp because it is prime and its reverse (39389901452101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10125410998393 - 233 = 10116821063801 is a prime.
It is not a weakly prime, because it can be changed into another prime (10125410998333) 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, 5062705499196 + 5062705499197.
It is an arithmetic number, because the mean of its divisors is an integer number (5062705499197).
Almost surely, 210125410998393 is an apocalyptic number.
It is an amenable number.
10125410998393 is a deficient number, since it is larger than the sum of its proper divisors (1).
10125410998393 is an equidigital number, since it uses as much as digits as its factorization.
10125410998393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2099520, while the sum is 55.
The spelling of 10125410998393 in words is "ten trillion, one hundred twenty-five billion, four hundred ten million, nine hundred ninety-eight thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •