Base | Representation |
---|---|
bin | 100010000010111… |
… | …1100101101111110 |
3 | 2221121122110001120 |
4 | 1010011330231332 |
5 | 4314424110420 |
6 | 305205451410 |
7 | 40211216502 |
oct | 10405745576 |
9 | 2847573046 |
10 | 1142410110 |
11 | 536951696 |
12 | 27a710b66 |
13 | 1528ac51a |
14 | aba1c302 |
15 | 6a461d40 |
hex | 4417cb7e |
1142410110 has 32 divisors (see below), whose sum is σ = 2767416192. Its totient is φ = 301794720.
The previous prime is 1142410067. The next prime is 1142410121. The reversal of 1142410110 is 110142411.
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 1142410110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 174736 + ... + 181155.
It is an arithmetic number, because the mean of its divisors is an integer number (86481756).
Almost surely, 21142410110 is an apocalyptic number.
1142410110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1142410110 is an abundant number, since it is smaller than the sum of its proper divisors (1625006082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142410110 is a wasteful number, since it uses less digits than its factorization.
1142410110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356008.
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 1142410110 is about 33799.5578373446. The cubic root of 1142410110 is about 1045.3795802144.
Adding to 1142410110 its reverse (110142411), we get a palindrome (1252552521).
The spelling of 1142410110 in words is "one billion, one hundred forty-two million, four hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •