Base | Representation |
---|---|
bin | 111101110000000111… |
… | …0110001101111001000 |
3 | 110200021212222020012010 |
4 | 1323200032301233020 |
5 | 4133041403122000 |
6 | 140530505415520 |
7 | 12403136544120 |
oct | 1734016615710 |
9 | 420255866163 |
10 | 132610989000 |
11 | 5127049a886 |
12 | 2184b19a5a0 |
13 | c674ac4539 |
14 | 65c016bc80 |
15 | 36b21b4d50 |
hex | 1ee03b1bc8 |
132610989000 has 128 divisors (see below), whose sum is σ = 472852972800. Its totient is φ = 30311078400.
The previous prime is 132610988977. The next prime is 132610989011. The reversal of 132610989000 is 989016231.
It is a self number, because there is not a number n which added to its sum of digits gives 132610989000.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 3136405 + ... + 3178404.
It is an arithmetic number, because the mean of its divisors is an integer number (3694163850).
Almost surely, 2132610989000 is an apocalyptic number.
132610989000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132610989000 is an abundant number, since it is smaller than the sum of its proper divisors (340241983800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132610989000 is a wasteful number, since it uses less digits than its factorization.
132610989000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6314840 (or 6314826 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 39.
The spelling of 132610989000 in words is "one hundred thirty-two billion, six hundred ten million, nine hundred eighty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •