Base | Representation |
---|---|
bin | 10110110000110011110100… |
… | …100000111001111111111001 |
3 | 111010110112111122201220222211 |
4 | 112300303310200321333321 |
5 | 101110210214200031131 |
6 | 552530241140415121 |
7 | 30041536601440024 |
oct | 2660636440717771 |
9 | 433415448656884 |
10 | 100111200002041 |
11 | 29997a15564608 |
12 | b28a27a3a74a1 |
13 | 43b25a4138217 |
14 | 1aa159d5261bb |
15 | b891c6e035b1 |
hex | 5b0cf4839ff9 |
100111200002041 has 2 divisors, whose sum is σ = 100111200002042. Its totient is φ = 100111200002040.
The previous prime is 100111200002017. The next prime is 100111200002059. The reversal of 100111200002041 is 140200002111001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65394652196416 + 34716547805625 = 8086696^2 + 5892075^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111200002041 - 227 = 100111065784313 is a prime.
It is not a weakly prime, because it can be changed into another prime (100111200102041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055600001020 + 50055600001021.
It is an arithmetic number, because the mean of its divisors is an integer number (50055600001021).
Almost surely, 2100111200002041 is an apocalyptic number.
It is an amenable number.
100111200002041 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111200002041 is an equidigital number, since it uses as much as digits as its factorization.
100111200002041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100111200002041 its reverse (140200002111001), we get a palindrome (240311202113042).
The spelling of 100111200002041 in words is "one hundred trillion, one hundred eleven billion, two hundred million, two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •