Base | Representation |
---|---|
bin | 1001001100101101100110… |
… | …0100000111111010110101 |
3 | 1022210220000021020211022011 |
4 | 2103023121210013322311 |
5 | 2311201434300442102 |
6 | 33302150420004221 |
7 | 2062466266140541 |
oct | 223133144077265 |
9 | 38726007224264 |
10 | 10114003140277 |
11 | 324a363112723 |
12 | 11741b3230671 |
13 | 584991b0628a |
14 | 26d73dc42a21 |
15 | 12814d6d12d7 |
hex | 932d9907eb5 |
10114003140277 has 2 divisors, whose sum is σ = 10114003140278. Its totient is φ = 10114003140276.
The previous prime is 10114003140119. The next prime is 10114003140299. The reversal of 10114003140277 is 77204130041101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5924555589681 + 4189447550596 = 2434041^2 + 2046814^2 .
It is a cyclic number.
It is not a de Polignac number, because 10114003140277 - 211 = 10114003138229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10114003140377) 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, 5057001570138 + 5057001570139.
It is an arithmetic number, because the mean of its divisors is an integer number (5057001570139).
Almost surely, 210114003140277 is an apocalyptic number.
It is an amenable number.
10114003140277 is a deficient number, since it is larger than the sum of its proper divisors (1).
10114003140277 is an equidigital number, since it uses as much as digits as its factorization.
10114003140277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4704, while the sum is 31.
Adding to 10114003140277 its reverse (77204130041101), we get a palindrome (87318133181378).
The spelling of 10114003140277 in words is "ten trillion, one hundred fourteen billion, three million, one hundred forty thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •