Base | Representation |
---|---|
bin | 100001001011000… |
… | …1010000000010000 |
3 | 2212120111120011220 |
4 | 1002112022000100 |
5 | 4234423320100 |
6 | 302241405040 |
7 | 36404142222 |
oct | 10226120020 |
9 | 2776446156 |
10 | 1113104400 |
11 | 5213558a1 |
12 | 270939780 |
13 | 1497bb575 |
14 | a7b90412 |
15 | 67ac3aa0 |
hex | 4258a010 |
1113104400 has 60 divisors (see below), whose sum is σ = 3565648272. Its totient is φ = 296827520.
The previous prime is 1113104309. The next prime is 1113104401. The reversal of 1113104400 is 44013111.
It is a tau number, because it is divible by the number of its divisors (60).
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 1113104400.
It is not an unprimeable number, because it can be changed into a prime (1113104401) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 462594 + ... + 464993.
Almost surely, 21113104400 is an apocalyptic number.
1113104400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113104400 is an abundant number, since it is smaller than the sum of its proper divisors (2452543872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113104400 is a wasteful number, since it uses less digits than its factorization.
1113104400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 927608 (or 927597 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1113104400 is about 33363.2192691293. The cubic root of 1113104400 is about 1036.3631598532.
Adding to 1113104400 its reverse (44013111), we get a palindrome (1157117511).
The spelling of 1113104400 in words is "one billion, one hundred thirteen million, one hundred four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •