Base | Representation |
---|---|
bin | 100010010101101… |
… | …1010111110000111 |
3 | 2222022010112000022 |
4 | 1010223122332013 |
5 | 4324432431401 |
6 | 310200205355 |
7 | 40360551623 |
oct | 10453327607 |
9 | 2868115008 |
10 | 1152233351 |
11 | 541450a75 |
12 | 281a6985b |
13 | 15493b7a9 |
14 | ad058183 |
15 | 6b25271b |
hex | 44adaf87 |
1152233351 has 8 divisors (see below), whose sum is σ = 1166373264. Its totient is φ = 1138147200.
The previous prime is 1152233333. The next prime is 1152233363. The reversal of 1152233351 is 1533322511.
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 1152233351 - 222 = 1148039047 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 1152233351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1152233311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30560 + ... + 56906.
It is an arithmetic number, because the mean of its divisors is an integer number (145796658).
Almost surely, 21152233351 is an apocalyptic number.
1152233351 is a deficient number, since it is larger than the sum of its proper divisors (14139913).
1152233351 is a wasteful number, since it uses less digits than its factorization.
1152233351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26881.
The product of its digits is 2700, while the sum is 26.
The square root of 1152233351 is about 33944.5629077766. The cubic root of 1152233351 is about 1048.3673344587.
Adding to 1152233351 its reverse (1533322511), we get a palindrome (2685555862).
The spelling of 1152233351 in words is "one billion, one hundred fifty-two million, two hundred thirty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •