Base | Representation |
---|---|
bin | 100010010101100… |
… | …0100101110000011 |
3 | 2222021221212222202 |
4 | 1010223010232003 |
5 | 4324422022321 |
6 | 310154223415 |
7 | 40360022123 |
oct | 10453045603 |
9 | 2867855882 |
10 | 1152142211 |
11 | 541399550 |
12 | 281a24b6b |
13 | 15490916c |
14 | ad032c83 |
15 | 6b23570b |
hex | 44ac4b83 |
1152142211 has 8 divisors (see below), whose sum is σ = 1262521344. Its totient is φ = 1042702920.
The previous prime is 1152142181. The next prime is 1152142213. The reversal of 1152142211 is 1122412511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1152142211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1152142213) 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, 232391 + ... + 237296.
It is an arithmetic number, because the mean of its divisors is an integer number (157815168).
Almost surely, 21152142211 is an apocalyptic number.
1152142211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1152142211 is a deficient number, since it is larger than the sum of its proper divisors (110379133).
1152142211 is a wasteful number, since it uses less digits than its factorization.
1152142211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469921.
The product of its digits is 160, while the sum is 20.
The square root of 1152142211 is about 33943.2203981885. The cubic root of 1152142211 is about 1048.3396922807.
Adding to 1152142211 its reverse (1122412511), we get a palindrome (2274554722).
The spelling of 1152142211 in words is "one billion, one hundred fifty-two million, one hundred forty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •