Base | Representation |
---|---|
bin | 111101100101000… |
… | …101100111110010 |
3 | 2200000000120101210 |
4 | 331211011213302 |
5 | 4103440220110 |
6 | 250303340550 |
7 | 34413324123 |
oct | 7545054762 |
9 | 2600016353 |
10 | 1033132530 |
11 | 4901a3841 |
12 | 249bb1756 |
13 | 13606ac31 |
14 | 9b2d404a |
15 | 60a78520 |
hex | 3d9459f2 |
1033132530 has 16 divisors (see below), whose sum is σ = 2479518144. Its totient is φ = 275502000.
The previous prime is 1033132523. The next prime is 1033132531. The reversal of 1033132530 is 352313301.
It is a junction number, because it is equal to n+sod(n) for n = 1033132497 and 1033132506.
It is not an unprimeable number, because it can be changed into a prime (1033132531) 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, 17218846 + ... + 17218905.
It is an arithmetic number, because the mean of its divisors is an integer number (154969884).
Almost surely, 21033132530 is an apocalyptic number.
1033132530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1033132530 is an abundant number, since it is smaller than the sum of its proper divisors (1446385614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033132530 is a wasteful number, since it uses less digits than its factorization.
1033132530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34437761.
The product of its (nonzero) digits is 810, while the sum is 21.
The square root of 1033132530 is about 32142.3790345394. The cubic root of 1033132530 is about 1010.9243995788.
Adding to 1033132530 its reverse (352313301), we get a palindrome (1385445831).
The spelling of 1033132530 in words is "one billion, thirty-three million, one hundred thirty-two thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •