Base | Representation |
---|---|
bin | 1101010010000… |
… | …10001111110000 |
3 | 21202122202001111 |
4 | 12221002033300 |
5 | 212010423100 |
6 | 15020043104 |
7 | 2522025550 |
oct | 651021760 |
9 | 252582044 |
10 | 111420400 |
11 | 57991883 |
12 | 31393494 |
13 | 1a111a40 |
14 | 10b25160 |
15 | 9bad6ba |
hex | 6a423f0 |
111420400 has 120 divisors (see below), whose sum is σ = 329569184. Its totient is φ = 35251200.
The previous prime is 111420391. The next prime is 111420401. The reversal of 111420400 is 4024111.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111420401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34870 + ... + 37930.
Almost surely, 2111420400 is an apocalyptic number.
111420400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111420400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164784592).
111420400 is an abundant number, since it is smaller than the sum of its proper divisors (218148784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111420400 is a wasteful number, since it uses less digits than its factorization.
111420400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3099 (or 3088 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 111420400 is about 10555.5861987859. The cubic root of 111420400 is about 481.1955152800.
Adding to 111420400 its reverse (4024111), we get a palindrome (115444511).
The spelling of 111420400 in words is "one hundred eleven million, four hundred twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •