Base | Representation |
---|---|
bin | 1001000110110001111110… |
… | …1110010111011001110101 |
3 | 1022110010222112102111220221 |
4 | 2101230133232113121311 |
5 | 2303014240324441112 |
6 | 33143255023454341 |
7 | 2052231124312003 |
oct | 221543756273165 |
9 | 38403875374827 |
10 | 10012101015157 |
11 | 321012100a89a |
12 | 11584b44573b1 |
13 | 5781a21ca917 |
14 | 268834323a73 |
15 | 1256874b8e07 |
hex | 91b1fb97675 |
10012101015157 has 2 divisors, whose sum is σ = 10012101015158. Its totient is φ = 10012101015156.
The previous prime is 10012101015127. The next prime is 10012101015227. The reversal of 10012101015157 is 75151010121001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5256042271236 + 4756058743921 = 2292606^2 + 2180839^2 .
It is an emirp because it is prime and its reverse (75151010121001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10012101015157 - 243 = 1216007992949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10012101015127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006050507578 + 5006050507579.
It is an arithmetic number, because the mean of its divisors is an integer number (5006050507579).
Almost surely, 210012101015157 is an apocalyptic number.
It is an amenable number.
10012101015157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012101015157 is an equidigital number, since it uses as much as digits as its factorization.
10012101015157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 350, while the sum is 25.
Adding to 10012101015157 its reverse (75151010121001), we get a palindrome (85163111136158).
The spelling of 10012101015157 in words is "ten trillion, twelve billion, one hundred one million, fifteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •