Base | Representation |
---|---|
bin | 100001100010011… |
… | …0000110100010100 |
3 | 2220102111021120202 |
4 | 1003010300310110 |
5 | 4301040301004 |
6 | 303355320032 |
7 | 36613036112 |
oct | 10304606424 |
9 | 2812437522 |
10 | 1125322004 |
11 | 528240094 |
12 | 274a50018 |
13 | 14c1a8611 |
14 | a9650ab2 |
15 | 68bd8b1e |
hex | 43130d14 |
1125322004 has 12 divisors (see below), whose sum is σ = 2085155604. Its totient is φ = 529563264.
The previous prime is 1125321983. The next prime is 1125322007. The reversal of 1125322004 is 4002235211.
It can be written as a sum of positive squares in 2 ways, for example, as 939545104 + 185776900 = 30652^2 + 13630^2 .
It is a super-2 number, since 2×11253220042 = 2532699225373152032, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1125322007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8274359 + ... + 8274494.
It is an arithmetic number, because the mean of its divisors is an integer number (173762967).
Almost surely, 21125322004 is an apocalyptic number.
It is an amenable number.
1125322004 is a deficient number, since it is larger than the sum of its proper divisors (959833600).
1125322004 is a wasteful number, since it uses less digits than its factorization.
1125322004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16548874 (or 16548872 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 1125322004 is about 33545.8194712843. The cubic root of 1125322004 is about 1040.1411309952.
Adding to 1125322004 its reverse (4002235211), we get a palindrome (5127557215).
The spelling of 1125322004 in words is "one billion, one hundred twenty-five million, three hundred twenty-two thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •