Base | Representation |
---|---|
bin | 100001000101001… |
… | …0111010011010110 |
3 | 2212100200111202212 |
4 | 1002022113103112 |
5 | 4233130410032 |
6 | 302051233422 |
7 | 36335645630 |
oct | 10212272326 |
9 | 2770614685 |
10 | 1110013142 |
11 | 51a634337 |
12 | 26b8a8872 |
13 | 148c78514 |
14 | a75c7a50 |
15 | 676b2bb2 |
hex | 422974d6 |
1110013142 has 8 divisors (see below), whose sum is σ = 1902879696. Its totient is φ = 475719912.
The previous prime is 1110013141. The next prime is 1110013169. The reversal of 1110013142 is 2413100111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 79286653 = 1110013142 / (1 + 1 + 1 + 0 + 0 + 1 + 3 + 1 + 4 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110013141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39643313 + ... + 39643340.
It is an arithmetic number, because the mean of its divisors is an integer number (237859962).
Almost surely, 21110013142 is an apocalyptic number.
1110013142 is a deficient number, since it is larger than the sum of its proper divisors (792866554).
1110013142 is an equidigital number, since it uses as much as digits as its factorization.
1110013142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79286662.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1110013142 is about 33316.8597259706. The cubic root of 1110013142 is about 1035.4028916819.
Adding to 1110013142 its reverse (2413100111), we get a palindrome (3523113253).
It can be divided in two parts, 11100 and 13142, that added together give a palindrome (24242).
The spelling of 1110013142 in words is "one billion, one hundred ten million, thirteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •