Base | Representation |
---|---|
bin | 111100111001010… |
… | …101001110100000 |
3 | 2122012102210221111 |
4 | 330321111032200 |
5 | 4043021141422 |
6 | 245213433104 |
7 | 34213661512 |
oct | 7471251640 |
9 | 2565383844 |
10 | 1021662112 |
11 | 484779959 |
12 | 24619b794 |
13 | 133882cc3 |
14 | 99989bb2 |
15 | 5ea5ea77 |
hex | 3ce553a0 |
1021662112 has 48 divisors (see below), whose sum is σ = 2129228640. Its totient is φ = 481727232.
The previous prime is 1021662043. The next prime is 1021662119. The reversal of 1021662112 is 2112661201.
1021662112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (1021662119) 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, 27103 + ... + 52705.
It is an arithmetic number, because the mean of its divisors is an integer number (44358930).
Almost surely, 21021662112 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 1021662112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1064614320).
1021662112 is an abundant number, since it is smaller than the sum of its proper divisors (1107566528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021662112 is a wasteful number, since it uses less digits than its factorization.
1021662112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25685 (or 25677 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 1021662112 is about 31963.4496260964. The cubic root of 1021662112 is about 1007.1691839758.
The spelling of 1021662112 in words is "one billion, twenty-one million, six hundred sixty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •