Base | Representation |
---|---|
bin | 1001011000001000100010… |
… | …1011001011001111111001 |
3 | 1100111122110120121011120221 |
4 | 2112002020223023033321 |
5 | 2322410304404430131 |
6 | 33532240331020041 |
7 | 2112613504343626 |
oct | 226021053131771 |
9 | 40448416534527 |
10 | 10310214530041 |
11 | 33155a0351988 |
12 | 11a6231b9a621 |
13 | 59a33124833a |
14 | 279034ab934d |
15 | 12d2d4239411 |
hex | 96088acb3f9 |
10310214530041 has 2 divisors, whose sum is σ = 10310214530042. Its totient is φ = 10310214530040.
The previous prime is 10310214530017. The next prime is 10310214530047. The reversal of 10310214530041 is 14003541201301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9911138054416 + 399076475625 = 3148196^2 + 631725^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10310214530041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10310214529988 and 10310214530015.
It is not a weakly prime, because it can be changed into another prime (10310214530047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155107265020 + 5155107265021.
It is an arithmetic number, because the mean of its divisors is an integer number (5155107265021).
Almost surely, 210310214530041 is an apocalyptic number.
It is an amenable number.
10310214530041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10310214530041 is an equidigital number, since it uses as much as digits as its factorization.
10310214530041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 10310214530041 its reverse (14003541201301), we get a palindrome (24313755731342).
The spelling of 10310214530041 in words is "ten trillion, three hundred ten billion, two hundred fourteen million, five hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •