Base | Representation |
---|---|
bin | 100010010110000… |
… | …0110100111010001 |
3 | 2222022110121020010 |
4 | 1010230012213101 |
5 | 4330004141423 |
6 | 310204105133 |
7 | 40362225036 |
oct | 10454064721 |
9 | 2868417203 |
10 | 1152412113 |
11 | 541563306 |
12 | 281b351a9 |
13 | 1549a1c78 |
14 | ad0a338d |
15 | 6b28a693 |
hex | 44b069d1 |
1152412113 has 8 divisors (see below), whose sum is σ = 1542926176. Its totient is φ = 765086400.
The previous prime is 1152412069. The next prime is 1152412117. The reversal of 1152412113 is 3112142511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1152412113 - 210 = 1152411089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1152412113.
It is not an unprimeable number, because it can be changed into a prime (1152412117) 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, 796243 + ... + 797688.
It is an arithmetic number, because the mean of its divisors is an integer number (192865772).
Almost surely, 21152412113 is an apocalyptic number.
It is an amenable number.
1152412113 is a deficient number, since it is larger than the sum of its proper divisors (390514063).
1152412113 is a wasteful number, since it uses less digits than its factorization.
1152412113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594175.
The product of its digits is 240, while the sum is 21.
The square root of 1152412113 is about 33947.1959519487. The cubic root of 1152412113 is about 1048.4215475948.
Adding to 1152412113 its reverse (3112142511), we get a palindrome (4264554624).
The spelling of 1152412113 in words is "one billion, one hundred fifty-two million, four hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •