Base | Representation |
---|---|
bin | 100001101111100… |
… | …0111010110000111 |
3 | 2220220111020121022 |
4 | 1003133013112013 |
5 | 4304322330043 |
6 | 304203341355 |
7 | 40025540111 |
oct | 10337072607 |
9 | 2826436538 |
10 | 1132230023 |
11 | 5311291a1 |
12 | 27722185b |
13 | 1507569c2 |
14 | aa52c3b1 |
15 | 69600868 |
hex | 437c7587 |
1132230023 has 8 divisors (see below), whose sum is σ = 1145249280. Its totient is φ = 1119256120.
The previous prime is 1132230017. The next prime is 1132230041. The reversal of 1132230023 is 3200322311.
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 1132230023 - 214 = 1132213639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1132229983 and 1132230010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132260023) 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, 40208 + ... + 62298.
It is an arithmetic number, because the mean of its divisors is an integer number (143156160).
Almost surely, 21132230023 is an apocalyptic number.
1132230023 is a deficient number, since it is larger than the sum of its proper divisors (13019257).
1132230023 is a wasteful number, since it uses less digits than its factorization.
1132230023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22677.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 1132230023 is about 33648.6258709030. The cubic root of 1132230023 is about 1042.2651635736.
Adding to 1132230023 its reverse (3200322311), we get a palindrome (4332552334).
The spelling of 1132230023 in words is "one billion, one hundred thirty-two million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •