Base | Representation |
---|---|
bin | 1111101111001… |
… | …11100010110000 |
3 | 100012102022221110 |
4 | 13313213202300 |
5 | 232244123100 |
6 | 21033353320 |
7 | 3162104061 |
oct | 767474260 |
9 | 305368843 |
10 | 132020400 |
11 | 68581976 |
12 | 38268840 |
13 | 214752a5 |
14 | 13768568 |
15 | b8cc250 |
hex | 7de78b0 |
132020400 has 60 divisors (see below), whose sum is σ = 422909192. Its totient is φ = 35205120.
The previous prime is 132020389. The next prime is 132020411. The reversal of 132020400 is 4020231.
132020400 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (132020389) and next prime (132020411).
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 53809 + ... + 56208.
Almost surely, 2132020400 is an apocalyptic number.
132020400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132020400 is an abundant number, since it is smaller than the sum of its proper divisors (290888792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132020400 is a wasteful number, since it uses less digits than its factorization.
132020400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110038 (or 110027 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 132020400 is about 11490.0130548229. The cubic root of 132020400 is about 509.1905652928.
Adding to 132020400 its reverse (4020231), we get a palindrome (136040631).
The spelling of 132020400 in words is "one hundred thirty-two million, twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •