Base | Representation |
---|---|
bin | 111101011011110… |
… | …100000010110000 |
3 | 2122211110001021201 |
4 | 331123310002300 |
5 | 4102324414412 |
6 | 250135300544 |
7 | 34353546601 |
oct | 7533640260 |
9 | 2584401251 |
10 | 1030701232 |
11 | 489893100 |
12 | 24921a754 |
13 | 1356c93b2 |
14 | 9ac5dda8 |
15 | 60747e57 |
hex | 3d6f40b0 |
1030701232 has 60 divisors (see below), whose sum is σ = 2209664128. Its totient is φ = 465379200.
The previous prime is 1030701187. The next prime is 1030701241. The reversal of 1030701232 is 2321070301.
1030701232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an alternating number because its digits alternate between odd and even.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 302257 + ... + 305647.
Almost surely, 21030701232 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 1030701232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1104832064).
1030701232 is an abundant number, since it is smaller than the sum of its proper divisors (1178962896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030701232 is a wasteful number, since it uses less digits than its factorization.
1030701232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3578 (or 3561 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 19.
The square root of 1030701232 is about 32104.5360034996. The cubic root of 1030701232 is about 1010.1307650186.
Adding to 1030701232 its reverse (2321070301), we get a palindrome (3351771533).
The spelling of 1030701232 in words is "one billion, thirty million, seven hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •