Base | Representation |
---|---|
bin | 100001101111100… |
… | …0101011111100001 |
3 | 2220220110212012012 |
4 | 1003133011133201 |
5 | 4304322104213 |
6 | 304203242305 |
7 | 40025506016 |
oct | 10337053741 |
9 | 2826425165 |
10 | 1132222433 |
11 | 531123521 |
12 | 277219395 |
13 | 150753404 |
14 | aa52970d |
15 | 695ed4a8 |
hex | 437c57e1 |
1132222433 has 8 divisors (see below), whose sum is σ = 1156889088. Its totient is φ = 1107579904.
The previous prime is 1132222387. The next prime is 1132222439. The reversal of 1132222433 is 3342222311.
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 1132222433 - 222 = 1128028129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1132222399 and 1132222408.
It is not an unprimeable number, because it can be changed into a prime (1132222439) 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, 114785 + ... + 124257.
It is an arithmetic number, because the mean of its divisors is an integer number (144611136).
Almost surely, 21132222433 is an apocalyptic number.
It is an amenable number.
1132222433 is a deficient number, since it is larger than the sum of its proper divisors (24666655).
1132222433 is an equidigital number, since it uses as much as digits as its factorization.
1132222433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12063.
The product of its digits is 1728, while the sum is 23.
The square root of 1132222433 is about 33648.5130875051. The cubic root of 1132222433 is about 1042.2628345974.
Adding to 1132222433 its reverse (3342222311), we get a palindrome (4474444744).
The spelling of 1132222433 in words is "one billion, one hundred thirty-two million, two hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •