Base | Representation |
---|---|
bin | 111101100010010… |
… | …101101111100010 |
3 | 2122221122222012022 |
4 | 331202111233202 |
5 | 4103244142010 |
6 | 250240101442 |
7 | 34404233621 |
oct | 7542255742 |
9 | 2587588168 |
10 | 1032412130 |
11 | 48a851572 |
12 | 249904882 |
13 | 135b78069 |
14 | 9b1876b8 |
15 | 60984d55 |
hex | 3d895be2 |
1032412130 has 16 divisors (see below), whose sum is σ = 1858810680. Its totient is φ = 412860672.
The previous prime is 1032412099. The next prime is 1032412133. The reversal of 1032412130 is 312142301.
It can be written as a sum of positive squares in 4 ways, for example, as 959326729 + 73085401 = 30973^2 + 8549^2 .
It is a super-2 number, since 2×10324121302 = 2131749612342273800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1032412099 and 1032412108.
It is not an unprimeable number, because it can be changed into a prime (1032412133) 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, 38186 + ... + 59354.
Almost surely, 21032412130 is an apocalyptic number.
1032412130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1032412130 is a deficient number, since it is larger than the sum of its proper divisors (826398550).
1032412130 is a wasteful number, since it uses less digits than its factorization.
1032412130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26053.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1032412130 is about 32131.1706914018. The cubic root of 1032412130 is about 1010.6893734954.
Adding to 1032412130 its reverse (312142301), we get a palindrome (1344554431).
The spelling of 1032412130 in words is "one billion, thirty-two million, four hundred twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •