Base | Representation |
---|---|
bin | 1001001001000011010011… |
… | …1000001001010011011001 |
3 | 1022120212200011212001112022 |
4 | 2102100310320021103121 |
5 | 2304134133303343131 |
6 | 33213225542424225 |
7 | 2055111614335451 |
oct | 222206470112331 |
9 | 38525604761468 |
10 | 10051110606041 |
11 | 32257199a58aa |
12 | 1163b80732075 |
13 | 57ba7b02058b |
14 | 26a69515cd61 |
15 | 1266bc06637b |
hex | 92434e094d9 |
10051110606041 has 2 divisors, whose sum is σ = 10051110606042. Its totient is φ = 10051110606040.
The previous prime is 10051110606029. The next prime is 10051110606067. The reversal of 10051110606041 is 14060601115001.
It is an a-pointer prime, because the next prime (10051110606067) can be obtained adding 10051110606041 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5690948996041 + 4360161610000 = 2385571^2 + 2088100^2 .
It is a cyclic number.
It is not a de Polignac number, because 10051110606041 - 222 = 10051106411737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10051110606041.
It is not a weakly prime, because it can be changed into another prime (10051110696041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5025555303020 + 5025555303021.
It is an arithmetic number, because the mean of its divisors is an integer number (5025555303021).
Almost surely, 210051110606041 is an apocalyptic number.
It is an amenable number.
10051110606041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10051110606041 is an equidigital number, since it uses as much as digits as its factorization.
10051110606041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 26.
The spelling of 10051110606041 in words is "ten trillion, fifty-one billion, one hundred ten million, six hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •