Base | Representation |
---|---|
bin | 100000110010010… |
… | …0100101011011001 |
3 | 2211200001012100121 |
4 | 1001210210223121 |
5 | 4223111401312 |
6 | 301055033241 |
7 | 36155515312 |
oct | 10144445331 |
9 | 2750035317 |
10 | 1100106457 |
11 | 514a8829a |
12 | 26850b821 |
13 | 146bba288 |
14 | a6169609 |
15 | 668a7707 |
hex | 41924ad9 |
1100106457 has 2 divisors, whose sum is σ = 1100106458. Its totient is φ = 1100106456.
The previous prime is 1100106373. The next prime is 1100106461. The reversal of 1100106457 is 7546010011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 622203136 + 477903321 = 24944^2 + 21861^2 .
It is an emirp because it is prime and its reverse (7546010011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100106457 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100106467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550053228 + 550053229.
It is an arithmetic number, because the mean of its divisors is an integer number (550053229).
Almost surely, 21100106457 is an apocalyptic number.
It is an amenable number.
1100106457 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100106457 is an equidigital number, since it uses as much as digits as its factorization.
1100106457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 1100106457 is about 33167.8527643862. The cubic root of 1100106457 is about 1032.3134154259.
Adding to 1100106457 its reverse (7546010011), we get a palindrome (8646116468).
The spelling of 1100106457 in words is "one billion, one hundred million, one hundred six thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •