Base | Representation |
---|---|
bin | 100000110010010… |
… | …0011001000101001 |
3 | 2211200000212200112 |
4 | 1001210203020221 |
5 | 4223111201022 |
6 | 301054544105 |
7 | 36155461013 |
oct | 10144431051 |
9 | 2750025615 |
10 | 1100100137 |
11 | 514a83574 |
12 | 268508035 |
13 | 146bb7436 |
14 | a61671b3 |
15 | 668a58e2 |
hex | 41923229 |
1100100137 has 2 divisors, whose sum is σ = 1100100138. Its totient is φ = 1100100136.
The previous prime is 1100100121. The next prime is 1100100149. The reversal of 1100100137 is 7310010011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 601426576 + 498673561 = 24524^2 + 22331^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100100137 - 24 = 1100100121 is a prime.
It is a super-2 number, since 2×11001001372 = 2420440622854837538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100100167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550050068 + 550050069.
It is an arithmetic number, because the mean of its divisors is an integer number (550050069).
Almost surely, 21100100137 is an apocalyptic number.
It is an amenable number.
1100100137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100100137 is an equidigital number, since it uses as much as digits as its factorization.
1100100137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 14.
The square root of 1100100137 is about 33167.7574912746. The cubic root of 1100100137 is about 1032.3114385768.
Adding to 1100100137 its reverse (7310010011), we get a palindrome (8410110148).
The spelling of 1100100137 in words is "one billion, one hundred million, one hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •