Base | Representation |
---|---|
bin | 111100111011001… |
… | …000001110001100 |
3 | 2122020022202001200 |
4 | 330323020032030 |
5 | 4043131230012 |
6 | 245231505500 |
7 | 34220662656 |
oct | 7473101614 |
9 | 2566282050 |
10 | 1022133132 |
11 | 484a70829 |
12 | 246388290 |
13 | 1339b9507 |
14 | 99a6d6d6 |
15 | 5eb043dc |
hex | 3cec838c |
1022133132 has 72 divisors (see below), whose sum is σ = 2611723296. Its totient is φ = 337042944.
The previous prime is 1022133107. The next prime is 1022133187. The reversal of 1022133132 is 2313312201.
1022133132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10221331322 = 2089512279064258848, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2098593 + ... + 2099079.
Almost surely, 21022133132 is an apocalyptic number.
1022133132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1022133132 is an abundant number, since it is smaller than the sum of its proper divisors (1589590164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022133132 is a wasteful number, since it uses less digits than its factorization.
1022133132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1007 (or 1002 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1022133132 is about 31970.8168803989. The cubic root of 1022133132 is about 1007.3239396228.
Adding to 1022133132 its reverse (2313312201), we get a palindrome (3335445333).
The spelling of 1022133132 in words is "one billion, twenty-two million, one hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •