Base | Representation |
---|---|
bin | 111101011110001101… |
… | …0010001010001110000 |
3 | 110121202000010221110002 |
4 | 1322330122101101300 |
5 | 4130324031201000 |
6 | 140351120525132 |
7 | 12352221446543 |
oct | 1727432212160 |
9 | 417660127402 |
10 | 132010022000 |
11 | 50a9224143a |
12 | 21701a807a8 |
13 | c5aa44a76c |
14 | 656441285a |
15 | 36795558d5 |
hex | 1ebc691470 |
132010022000 has 160 divisors (see below), whose sum is σ = 325280966400. Its totient is φ = 51801888000.
The previous prime is 132010021999. The next prime is 132010022033. The reversal of 132010022000 is 220010231.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 81537191 + ... + 81538809.
It is an arithmetic number, because the mean of its divisors is an integer number (2033006040).
Almost surely, 2132010022000 is an apocalyptic number.
132010022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132010022000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162640483200).
132010022000 is an abundant number, since it is smaller than the sum of its proper divisors (193270944400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132010022000 is a wasteful number, since it uses less digits than its factorization.
132010022000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2392 (or 2376 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 132010022000 its reverse (220010231), we get a palindrome (132230032231).
The spelling of 132010022000 in words is "one hundred thirty-two billion, ten million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •