Base | Representation |
---|---|
bin | 100000110100110… |
… | …0011100000110100 |
3 | 2211202111112210000 |
4 | 1001221203200310 |
5 | 4223430144104 |
6 | 301143031300 |
7 | 36202564611 |
oct | 10151434064 |
9 | 2752445700 |
10 | 1101412404 |
11 | 51579a494 |
12 | 268a3b530 |
13 | 147256821 |
14 | a63c9508 |
15 | 66a64639 |
hex | 41a63834 |
1101412404 has 60 divisors (see below), whose sum is σ = 2893135168. Its totient is φ = 365374800.
The previous prime is 1101412381. The next prime is 1101412427. The reversal of 1101412404 is 4042141011.
It is an interprime number because it is at equal distance from previous prime (1101412381) and next prime (1101412427).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 60309 + ... + 76419.
Almost surely, 21101412404 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1101412404, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1446567584).
1101412404 is an abundant number, since it is smaller than the sum of its proper divisors (1791722764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101412404 is a wasteful number, since it uses less digits than its factorization.
1101412404 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16338 (or 16327 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
The square root of 1101412404 is about 33187.5338643895. The cubic root of 1101412404 is about 1032.7217436335.
Adding to 1101412404 its reverse (4042141011), we get a palindrome (5143553415).
The spelling of 1101412404 in words is "one billion, one hundred one million, four hundred twelve thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •