Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000011001001101001101001 |
3 | 111010002000022121100221002212 |
4 | 112233031102003021221221 |
5 | 101101404223112013231 |
6 | 552403512101534505 |
7 | 30030561325005305 |
oct | 2657152203115151 |
9 | 433060277327085 |
10 | 100001100110441 |
11 | 29955256a97462 |
12 | b270a72114435 |
13 | 43a50a9034c7a |
14 | 1a9a116d7cd05 |
15 | b863d117842b |
hex | 5af3520c9a69 |
100001100110441 has 2 divisors, whose sum is σ = 100001100110442. Its totient is φ = 100001100110440.
The previous prime is 100001100110437. The next prime is 100001100110447. The reversal of 100001100110441 is 144011001100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 59194619990416 + 40806480120025 = 7693804^2 + 6387995^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001100110441 - 22 = 100001100110437 is a prime.
It is not a weakly prime, because it can be changed into another prime (100001100110447) 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, 50000550055220 + 50000550055221.
It is an arithmetic number, because the mean of its divisors is an integer number (50000550055221).
Almost surely, 2100001100110441 is an apocalyptic number.
It is an amenable number.
100001100110441 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001100110441 is an equidigital number, since it uses as much as digits as its factorization.
100001100110441 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 14.
Adding to 100001100110441 its reverse (144011001100001), we get a palindrome (244012101210442).
The spelling of 100001100110441 in words is "one hundred trillion, one billion, one hundred million, one hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •