Base | Representation |
---|---|
bin | 111100110101100… |
… | …001000111011000 |
3 | 2122010120000100220 |
4 | 330311201013120 |
5 | 4042242142412 |
6 | 245140200040 |
7 | 34202325432 |
oct | 7465410730 |
9 | 2563500326 |
10 | 1020662232 |
11 | 484156707 |
12 | 245999020 |
13 | 1335c2b65 |
14 | 997a9652 |
15 | 5e91368c |
hex | 3cd611d8 |
1020662232 has 32 divisors (see below), whose sum is σ = 2558630400. Its totient is φ = 339290784.
The previous prime is 1020662231. The next prime is 1020662239. The reversal of 1020662232 is 2322660201.
1020662232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020662231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49132 + ... + 66747.
It is an arithmetic number, because the mean of its divisors is an integer number (79957200).
Almost surely, 21020662232 is an apocalyptic number.
1020662232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1020662232 is an abundant number, since it is smaller than the sum of its proper divisors (1537968168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020662232 is a wasteful number, since it uses less digits than its factorization.
1020662232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116255 (or 116251 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 1020662232 is about 31947.8048072164. The cubic root of 1020662232 is about 1006.8405113757.
The spelling of 1020662232 in words is "one billion, twenty million, six hundred sixty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •