Base | Representation |
---|---|
bin | 100010010101101… |
… | …0011000110011001 |
3 | 2222022001212210022 |
4 | 1010223103012121 |
5 | 4324430413423 |
6 | 310155400225 |
7 | 40360355630 |
oct | 10453230631 |
9 | 2868055708 |
10 | 1152201113 |
11 | 541429828 |
12 | 281a53075 |
13 | 154929c0b |
14 | ad04a517 |
15 | 6b247dc8 |
hex | 44ad3199 |
1152201113 has 4 divisors (see below), whose sum is σ = 1316801280. Its totient is φ = 987600948.
The previous prime is 1152201109. The next prime is 1152201119. The reversal of 1152201113 is 3111022511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1152201113 - 22 = 1152201109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1152201091 and 1152201100.
It is not an unprimeable number, because it can be changed into a prime (1152201119) 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, 82300073 + ... + 82300086.
It is an arithmetic number, because the mean of its divisors is an integer number (329200320).
Almost surely, 21152201113 is an apocalyptic number.
It is an amenable number.
1152201113 is a deficient number, since it is larger than the sum of its proper divisors (164600167).
1152201113 is an equidigital number, since it uses as much as digits as its factorization.
1152201113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164600166.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 1152201113 is about 33944.0880419551. The cubic root of 1152201113 is about 1048.3575570465.
Adding to 1152201113 its reverse (3111022511), we get a palindrome (4263223624).
The spelling of 1152201113 in words is "one billion, one hundred fifty-two million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •