Base | Representation |
---|---|
bin | 111101110010101001… |
… | …1000100011110011000 |
3 | 110200111210221020220210 |
4 | 1323211103010132120 |
5 | 4133230134003113 |
6 | 140543143451120 |
7 | 12405221251566 |
oct | 1734523043630 |
9 | 420453836823 |
10 | 132696000408 |
11 | 51304484144 |
12 | 21873756aa0 |
13 | c6895ba94a |
14 | 65cb57aa36 |
15 | 36b98a86c3 |
hex | 1ee54c4798 |
132696000408 has 64 divisors (see below), whose sum is σ = 345799238400. Its totient is φ = 42380723840.
The previous prime is 132696000407. The next prime is 132696000439. The reversal of 132696000408 is 804000696231.
132696000408 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132696000407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 636516 + ... + 818867.
It is an arithmetic number, because the mean of its divisors is an integer number (5403113100).
Almost surely, 2132696000408 is an apocalyptic number.
It is an amenable number.
132696000408 is an abundant number, since it is smaller than the sum of its proper divisors (213103237992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132696000408 is a wasteful number, since it uses less digits than its factorization.
132696000408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1455552 (or 1455548 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 39.
Adding to 132696000408 its reverse (804000696231), we get a palindrome (936696696639).
The spelling of 132696000408 in words is "one hundred thirty-two billion, six hundred ninety-six million, four hundred eight", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •