Base | Representation |
---|---|
bin | 1111101111000… |
… | …11000011100100 |
3 | 100012101101201201 |
4 | 13313203003210 |
5 | 232243031040 |
6 | 21033132244 |
7 | 3161666353 |
oct | 767430344 |
9 | 305341651 |
10 | 132002020 |
11 | 6856a087 |
12 | 3825a084 |
13 | 21469b07 |
14 | 1376199a |
15 | b8c6a9a |
hex | 7de30e4 |
132002020 has 12 divisors (see below), whose sum is σ = 277204284. Its totient is φ = 52800800.
The previous prime is 132002011. The next prime is 132002069. The reversal of 132002020 is 20200231.
It can be written as a sum of positive squares in 2 ways, for example, as 20994724 + 111007296 = 4582^2 + 10536^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 132001988 and 132002006.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3300031 + ... + 3300070.
It is an arithmetic number, because the mean of its divisors is an integer number (23100357).
Almost surely, 2132002020 is an apocalyptic number.
132002020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132002020 is an abundant number, since it is smaller than the sum of its proper divisors (145202264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132002020 is a wasteful number, since it uses less digits than its factorization.
132002020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6600110 (or 6600108 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 10.
The square root of 132002020 is about 11489.2132019560. The cubic root of 132002020 is about 509.1669342051.
Adding to 132002020 its reverse (20200231), we get a palindrome (152202251).
The spelling of 132002020 in words is "one hundred thirty-two million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •