Base | Representation |
---|---|
bin | 100000110110101… |
… | …1000000100011110 |
3 | 2211211101102212020 |
4 | 1001231120010132 |
5 | 4224204222420 |
6 | 301220321010 |
7 | 36214236210 |
oct | 10155300436 |
9 | 2754342766 |
10 | 1102414110 |
11 | 516314046 |
12 | 269243166 |
13 | 147517755 |
14 | a65aa5b0 |
15 | 66bb1340 |
hex | 41b5811e |
1102414110 has 32 divisors (see below), whose sum is σ = 3023764992. Its totient is φ = 251980320.
The previous prime is 1102414037. The next prime is 1102414121. The reversal of 1102414110 is 114142011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1102414110.
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 2624586 + ... + 2625005.
It is an arithmetic number, because the mean of its divisors is an integer number (94492656).
Almost surely, 21102414110 is an apocalyptic number.
1102414110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1102414110 is an abundant number, since it is smaller than the sum of its proper divisors (1921350882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102414110 is a wasteful number, since it uses less digits than its factorization.
1102414110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5249608.
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 1102414110 is about 33202.6220350140. The cubic root of 1102414110 is about 1033.0347266450.
Adding to 1102414110 its reverse (114142011), we get a palindrome (1216556121).
The spelling of 1102414110 in words is "one billion, one hundred two million, four hundred fourteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •