Base | Representation |
---|---|
bin | 100001001001010… |
… | …0001100101011101 |
3 | 2212111201012022010 |
4 | 1002102201211131 |
5 | 4234202334123 |
6 | 302205141433 |
7 | 36363065601 |
oct | 10222414535 |
9 | 2774635263 |
10 | 1112152413 |
11 | 520865629 |
12 | 27055a879 |
13 | 149547168 |
14 | a79c3501 |
15 | 67986993 |
hex | 424a195d |
1112152413 has 8 divisors (see below), whose sum is σ = 1483027776. Its totient is φ = 741356000.
The previous prime is 1112152409. The next prime is 1112152421. The reversal of 1112152413 is 3142512111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1112152413 - 22 = 1112152409 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1112152413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112152453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34168 + ... + 58238.
It is an arithmetic number, because the mean of its divisors is an integer number (185378472).
Almost surely, 21112152413 is an apocalyptic number.
It is an amenable number.
1112152413 is a deficient number, since it is larger than the sum of its proper divisors (370875363).
1112152413 is a wasteful number, since it uses less digits than its factorization.
1112152413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39475.
The product of its digits is 240, while the sum is 21.
The square root of 1112152413 is about 33348.9492038355. The cubic root of 1112152413 is about 1036.0676243356.
Adding to 1112152413 its reverse (3142512111), we get a palindrome (4254664524).
The spelling of 1112152413 in words is "one billion, one hundred twelve million, one hundred fifty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •