Base | Representation |
---|---|
bin | 100111100001010… |
… | …1110110100011101 |
3 | 10102102022200100001 |
4 | 1033002232310131 |
5 | 10203441204000 |
6 | 335331134301 |
7 | 44601541525 |
oct | 11702566435 |
9 | 3372280301 |
10 | 1326116125 |
11 | 620615744 |
12 | 310144391 |
13 | 1819801c9 |
14 | c819c685 |
15 | 7b64d46a |
hex | 4f0aed1d |
1326116125 has 8 divisors (see below), whose sum is σ = 1654993080. Its totient is φ = 1060892800.
The previous prime is 1326116123. The next prime is 1326116137. The reversal of 1326116125 is 5216116231.
It can be written as a sum of positive squares in 4 ways, for example, as 87216921 + 1238899204 = 9339^2 + 35198^2 .
It is not a de Polignac number, because 1326116125 - 21 = 1326116123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1326116093 and 1326116102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1326116123) 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, 5304340 + ... + 5304589.
It is an arithmetic number, because the mean of its divisors is an integer number (206874135).
Almost surely, 21326116125 is an apocalyptic number.
It is an amenable number.
1326116125 is a deficient number, since it is larger than the sum of its proper divisors (328876955).
1326116125 is an equidigital number, since it uses as much as digits as its factorization.
1326116125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10608944 (or 10608934 counting only the distinct ones).
The product of its digits is 2160, while the sum is 28.
The square root of 1326116125 is about 36415.8773751231. The cubic root of 1326116125 is about 1098.6529309313.
The spelling of 1326116125 in words is "one billion, three hundred twenty-six million, one hundred sixteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •