Base | Representation |
---|---|
bin | 100001101111010… |
… | …0111111001100111 |
3 | 2220220020200220221 |
4 | 1003132213321213 |
5 | 4304304214343 |
6 | 304200505211 |
7 | 40024462441 |
oct | 10336477147 |
9 | 2826220827 |
10 | 1132101223 |
11 | 531050450 |
12 | 27717b207 |
13 | 1507101a6 |
14 | aa4d7491 |
15 | 695c75ed |
hex | 437a7e67 |
1132101223 has 8 divisors (see below), whose sum is σ = 1247248656. Its totient is φ = 1018992000.
The previous prime is 1132101221. The next prime is 1132101227. The reversal of 1132101223 is 3221012311.
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 1132101223 - 21 = 1132101221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1132101197 and 1132101206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132101221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 508386 + ... + 510607.
It is an arithmetic number, because the mean of its divisors is an integer number (155906082).
Almost surely, 21132101223 is an apocalyptic number.
1132101223 is a deficient number, since it is larger than the sum of its proper divisors (115147433).
1132101223 is a wasteful number, since it uses less digits than its factorization.
1132101223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019105.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1132101223 is about 33646.7119195918. The cubic root of 1132101223 is about 1042.2256401431.
Adding to 1132101223 its reverse (3221012311), we get a palindrome (4353113534).
The spelling of 1132101223 in words is "one billion, one hundred thirty-two million, one hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •