Base | Representation |
---|---|
bin | 111101100000000111… |
… | …1011110100011000000 |
3 | 110121220111002200112012 |
4 | 1323000033132203000 |
5 | 4130442010123012 |
6 | 140401334352052 |
7 | 12353632016660 |
oct | 1730017364300 |
9 | 417814080465 |
10 | 132074301632 |
11 | 510155556a9 |
12 | 2171b4bb628 |
13 | c5ba865650 |
14 | 656cb861a0 |
15 | 3680001622 |
hex | 1ec03de8c0 |
132074301632 has 56 divisors (see below), whose sum is σ = 322566097056. Its totient is φ = 52249171968.
The previous prime is 132074301631. The next prime is 132074301647. The reversal of 132074301632 is 236103470231.
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (132074301631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11332973 + ... + 11344620.
It is an arithmetic number, because the mean of its divisors is an integer number (5760108876).
Almost surely, 2132074301632 is an apocalyptic number.
It is an amenable number.
132074301632 is an abundant number, since it is smaller than the sum of its proper divisors (190491795424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132074301632 is a wasteful number, since it uses less digits than its factorization.
132074301632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22677625 (or 22677615 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 32.
Adding to 132074301632 its reverse (236103470231), we get a palindrome (368177771863).
The spelling of 132074301632 in words is "one hundred thirty-two billion, seventy-four million, three hundred one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •