Base | Representation |
---|---|
bin | 100010010101110… |
… | …1111001011010001 |
3 | 2222022021201112120 |
4 | 1010223233023101 |
5 | 4324443103423 |
6 | 310202044453 |
7 | 40361345124 |
oct | 10453571321 |
9 | 2868251476 |
10 | 1152316113 |
11 | 5414a8173 |
12 | 281aa9729 |
13 | 15496a370 |
14 | ad07a3bb |
15 | 6b26bee3 |
hex | 44aef2d1 |
1152316113 has 8 divisors (see below), whose sum is σ = 1654607808. Its totient is φ = 709117584.
The previous prime is 1152316091. The next prime is 1152316127. The reversal of 1152316113 is 3116132511.
1152316113 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1152316113 - 212 = 1152312017 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1152316133) 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, 14773245 + ... + 14773322.
It is an arithmetic number, because the mean of its divisors is an integer number (206825976).
Almost surely, 21152316113 is an apocalyptic number.
1152316113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1152316113 is a deficient number, since it is larger than the sum of its proper divisors (502291695).
1152316113 is a wasteful number, since it uses less digits than its factorization.
1152316113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29546583.
The product of its digits is 540, while the sum is 24.
The square root of 1152316113 is about 33945.7819618285. The cubic root of 1152316113 is about 1048.3924343802.
Adding to 1152316113 its reverse (3116132511), we get a palindrome (4268448624).
The spelling of 1152316113 in words is "one billion, one hundred fifty-two million, three hundred sixteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •