Base | Representation |
---|---|
bin | 100000110010010… |
… | …0011000111001001 |
3 | 2211200000212112222 |
4 | 1001210203013021 |
5 | 4223111200131 |
6 | 301054543425 |
7 | 36155460515 |
oct | 10144430711 |
9 | 2750025488 |
10 | 1100100041 |
11 | 514a83497 |
12 | 268507b75 |
13 | 146bb7391 |
14 | a6167145 |
15 | 668a587b |
hex | 419231c9 |
1100100041 has 2 divisors, whose sum is σ = 1100100042. Its totient is φ = 1100100040.
The previous prime is 1100099993. The next prime is 1100100061. The reversal of 1100100041 is 1400010011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1067655625 + 32444416 = 32675^2 + 5696^2 .
It is an emirp because it is prime and its reverse (1400010011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1100100041 - 26 = 1100099977 is a prime.
It is a super-3 number, since 3×11001000413 (a number of 28 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1100100061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550050020 + 550050021.
It is an arithmetic number, because the mean of its divisors is an integer number (550050021).
Almost surely, 21100100041 is an apocalyptic number.
It is an amenable number.
1100100041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100100041 is an equidigital number, since it uses as much as digits as its factorization.
1100100041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 1100100041 is about 33167.7560440859. The cubic root of 1100100041 is about 1032.3114085486.
Adding to 1100100041 its reverse (1400010011), we get a palindrome (2500110052).
The spelling of 1100100041 in words is "one billion, one hundred million, one hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •