Base | Representation |
---|---|
bin | 100000110010010… |
… | …0110101111111101 |
3 | 2211200001121222211 |
4 | 1001210212233331 |
5 | 4223112134231 |
6 | 301055140421 |
7 | 36155552122 |
oct | 10144465775 |
9 | 2750047884 |
10 | 1100114941 |
11 | 514a93702 |
12 | 268514711 |
13 | 146bc10b3 |
14 | a616c749 |
15 | 668a9eb1 |
hex | 41926bfd |
1100114941 has 2 divisors, whose sum is σ = 1100114942. Its totient is φ = 1100114940.
The previous prime is 1100114929. The next prime is 1100114959. The reversal of 1100114941 is 1494110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 913792441 + 186322500 = 30229^2 + 13650^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100114941 - 229 = 563244029 is a prime.
It is a super-2 number, since 2×11001149412 = 2420505766822866962, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100114921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550057470 + 550057471.
It is an arithmetic number, because the mean of its divisors is an integer number (550057471).
Almost surely, 21100114941 is an apocalyptic number.
It is an amenable number.
1100114941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100114941 is an equidigital number, since it uses as much as digits as its factorization.
1100114941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The square root of 1100114941 is about 33167.9806590633. The cubic root of 1100114941 is about 1032.3160691462.
Adding to 1100114941 its reverse (1494110011), we get a palindrome (2594224952).
The spelling of 1100114941 in words is "one billion, one hundred million, one hundred fourteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •