Base | Representation |
---|---|
bin | 100000110010010… |
… | …0101100011101001 |
3 | 2211200001101021221 |
4 | 1001210211203221 |
5 | 4223112010212 |
6 | 301055102041 |
7 | 36155531644 |
oct | 10144454351 |
9 | 2750041257 |
10 | 1100110057 |
11 | 514a8aa72 |
12 | 268511921 |
13 | 146bbbac7 |
14 | a616aa5b |
15 | 668a8807 |
hex | 419258e9 |
1100110057 has 2 divisors, whose sum is σ = 1100110058. Its totient is φ = 1100110056.
The previous prime is 1100110049. The next prime is 1100110117. The reversal of 1100110057 is 7500110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1072955536 + 27154521 = 32756^2 + 5211^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100110057 - 23 = 1100110049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1100110057.
It is not a weakly prime, because it can be changed into another prime (1100110007) 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, 550055028 + 550055029.
It is an arithmetic number, because the mean of its divisors is an integer number (550055029).
Almost surely, 21100110057 is an apocalyptic number.
It is an amenable number.
1100110057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100110057 is an equidigital number, since it uses as much as digits as its factorization.
1100110057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35, while the sum is 16.
The square root of 1100110057 is about 33167.9070337578. The cubic root of 1100110057 is about 1032.3145414757.
Adding to 1100110057 its reverse (7500110011), we get a palindrome (8600220068).
The spelling of 1100110057 in words is "one billion, one hundred million, one hundred ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •