Base | Representation |
---|---|
bin | 1001001110001111111100… |
… | …1011110011100001011001 |
3 | 1022220102011012022201000212 |
4 | 2103203333023303201121 |
5 | 2312120021422301012 |
6 | 33322234244140505 |
7 | 2064422444465231 |
oct | 223437713634131 |
9 | 38812135281025 |
10 | 10140404103257 |
11 | 325a58083599a |
12 | 1179340997735 |
13 | 58730b66766c |
14 | 270b262accc1 |
15 | 128b96388b22 |
hex | 938ff2f3859 |
10140404103257 has 2 divisors, whose sum is σ = 10140404103258. Its totient is φ = 10140404103256.
The previous prime is 10140404103161. The next prime is 10140404103293. The reversal of 10140404103257 is 75230140404101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7594014764176 + 2546389339081 = 2755724^2 + 1595741^2 .
It is a cyclic number.
It is not a de Polignac number, because 10140404103257 - 240 = 9040892475481 is a prime.
It is not a weakly prime, because it can be changed into another prime (10140404103457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070202051628 + 5070202051629.
It is an arithmetic number, because the mean of its divisors is an integer number (5070202051629).
Almost surely, 210140404103257 is an apocalyptic number.
It is an amenable number.
10140404103257 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140404103257 is an equidigital number, since it uses as much as digits as its factorization.
10140404103257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13440, while the sum is 32.
Adding to 10140404103257 its reverse (75230140404101), we get a palindrome (85370544507358).
The spelling of 10140404103257 in words is "ten trillion, one hundred forty billion, four hundred four million, one hundred three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •