Base | Representation |
---|---|
bin | 1001001100101111000101… |
… | …1110100111100100110001 |
3 | 1022210221001020012101221001 |
4 | 2103023301132213210301 |
5 | 2311203300003202012 |
6 | 33302254311202001 |
7 | 2062512240312124 |
oct | 223136136474461 |
9 | 38727036171831 |
10 | 10114404350257 |
11 | 324a549634719 |
12 | 11742a5676301 |
13 | 584a26c7c52c |
14 | 26d77b2403bb |
15 | 128173a33357 |
hex | 932f17a7931 |
10114404350257 has 2 divisors, whose sum is σ = 10114404350258. Its totient is φ = 10114404350256.
The previous prime is 10114404350207. The next prime is 10114404350261. The reversal of 10114404350257 is 75205340441101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5573452185856 + 4540952164401 = 2360816^2 + 2130951^2 .
It is a cyclic number.
It is not a de Polignac number, because 10114404350257 - 215 = 10114404317489 is a prime.
It is not a weakly prime, because it can be changed into another prime (10114404350207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5057202175128 + 5057202175129.
It is an arithmetic number, because the mean of its divisors is an integer number (5057202175129).
Almost surely, 210114404350257 is an apocalyptic number.
It is an amenable number.
10114404350257 is a deficient number, since it is larger than the sum of its proper divisors (1).
10114404350257 is an equidigital number, since it uses as much as digits as its factorization.
10114404350257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67200, while the sum is 37.
Adding to 10114404350257 its reverse (75205340441101), we get a palindrome (85319744791358).
The spelling of 10114404350257 in words is "ten trillion, one hundred fourteen billion, four hundred four million, three hundred fifty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •