Base | Representation |
---|---|
bin | 1001001100011111011110… |
… | …1111011000011111101101 |
3 | 1022210112020020010221212112 |
4 | 2103013313233120133231 |
5 | 2311121204344102231 |
6 | 33300322435013405 |
7 | 2062303352546066 |
oct | 223076757303755 |
9 | 38715206127775 |
10 | 10110214440941 |
11 | 324879952a84a |
12 | 117351643a265 |
13 | 584509bc7754 |
14 | 26d4a09b356d |
15 | 127ecac9892b |
hex | 931f7bd87ed |
10110214440941 has 2 divisors, whose sum is σ = 10110214440942. Its totient is φ = 10110214440940.
The previous prime is 10110214440929. The next prime is 10110214441031. The reversal of 10110214440941 is 14904441201101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7778638138441 + 2331576302500 = 2789021^2 + 1526950^2 .
It is an emirp because it is prime and its reverse (14904441201101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10110214440941 - 222 = 10110210246637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10110214440898 and 10110214440907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110214440241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055107220470 + 5055107220471.
It is an arithmetic number, because the mean of its divisors is an integer number (5055107220471).
Almost surely, 210110214440941 is an apocalyptic number.
It is an amenable number.
10110214440941 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110214440941 is an equidigital number, since it uses as much as digits as its factorization.
10110214440941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 32.
The spelling of 10110214440941 in words is "ten trillion, one hundred ten billion, two hundred fourteen million, four hundred forty thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •