Base | Representation |
---|---|
bin | 100001011110011… |
… | …0000101010101000 |
3 | 2220021112200222111 |
4 | 1002330300222220 |
5 | 4300021133412 |
6 | 303242332104 |
7 | 36556151134 |
oct | 10274605250 |
9 | 2807480874 |
10 | 1123224232 |
11 | 527037a99 |
12 | 2741ba034 |
13 | 14b922830 |
14 | a92663c4 |
15 | 689222a7 |
hex | 42f30aa8 |
1123224232 has 64 divisors (see below), whose sum is σ = 2329382160. Its totient is φ = 504576000.
The previous prime is 1123224173. The next prime is 1123224253. The reversal of 1123224232 is 2324223211.
It can be written as a sum of positive squares in 8 ways, for example, as 81613156 + 1041611076 = 9034^2 + 32274^2 .
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 639868 + ... + 641620.
Almost surely, 21123224232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1123224232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1164691080).
1123224232 is an abundant number, since it is smaller than the sum of its proper divisors (1206157928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123224232 is a wasteful number, since it uses less digits than its factorization.
1123224232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1934 (or 1930 counting only the distinct ones).
The product of its digits is 1152, while the sum is 22.
The square root of 1123224232 is about 33514.5376217545. The cubic root of 1123224232 is about 1039.4944016780.
Adding to 1123224232 its reverse (2324223211), we get a palindrome (3447447443).
The spelling of 1123224232 in words is "one billion, one hundred twenty-three million, two hundred twenty-four thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •