Base | Representation |
---|---|
bin | 100000110010010… |
… | …0011001100111011 |
3 | 2211200000220001200 |
4 | 1001210203030323 |
5 | 4223111203121 |
6 | 301054545243 |
7 | 36155461554 |
oct | 10144431473 |
9 | 2750026050 |
10 | 1100100411 |
11 | 514a837a3 |
12 | 268508223 |
13 | 146bb75b7 |
14 | a616732b |
15 | 668a5a26 |
hex | 4192333b |
1100100411 has 6 divisors (see below), whose sum is σ = 1589033940. Its totient is φ = 733400268.
The previous prime is 1100100389. The next prime is 1100100427. The reversal of 1100100411 is 1140010011.
It is a de Polignac number, because none of the positive numbers 2k-1100100411 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 122233379 = 1100100411 / (1 + 1 + 0 + 0 + 1 + 0 + 0 + 4 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 1100100393 and 1100100402.
It is not an unprimeable number, because it can be changed into a prime (1100100811) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61116681 + ... + 61116698.
It is an arithmetic number, because the mean of its divisors is an integer number (264838990).
Almost surely, 21100100411 is an apocalyptic number.
1100100411 is a deficient number, since it is larger than the sum of its proper divisors (488933529).
1100100411 is a wasteful number, since it uses less digits than its factorization.
1100100411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122233385 (or 122233382 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1100100411 is about 33167.7616217917. The cubic root of 1100100411 is about 1032.3115242821.
Adding to 1100100411 its reverse (1140010011), we get a palindrome (2240110422).
The spelling of 1100100411 in words is "one billion, one hundred million, one hundred thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •