Base | Representation |
---|---|
bin | 100001011000010… |
… | …0000100001111101 |
3 | 2220001111112012020 |
4 | 1002300200201331 |
5 | 4243210344123 |
6 | 303045430353 |
7 | 36516643212 |
oct | 10260404175 |
9 | 2801445166 |
10 | 1120012413 |
11 | 5252439a3 |
12 | 27310b3b9 |
13 | 14b069950 |
14 | a8a6bb09 |
15 | 684da7e3 |
hex | 42c2087d |
1120012413 has 8 divisors (see below), whose sum is σ = 1608223008. Its totient is φ = 689238384.
The previous prime is 1120012381. The next prime is 1120012417. The reversal of 1120012413 is 3142100211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1120012413 - 25 = 1120012381 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1120012392 and 1120012401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120012417) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14359095 + ... + 14359172.
It is an arithmetic number, because the mean of its divisors is an integer number (201027876).
Almost surely, 21120012413 is an apocalyptic number.
1120012413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1120012413 is a deficient number, since it is larger than the sum of its proper divisors (488210595).
1120012413 is a wasteful number, since it uses less digits than its factorization.
1120012413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28718283.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1120012413 is about 33466.5865155083. The cubic root of 1120012413 is about 1038.5026569292.
Adding to 1120012413 its reverse (3142100211), we get a palindrome (4262112624).
The spelling of 1120012413 in words is "one billion, one hundred twenty million, twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •