Base | Representation |
---|---|
bin | 111101100111110001… |
… | …0100000001110010110 |
3 | 110122120101000122102220 |
4 | 1323033202200032112 |
5 | 4132003210304403 |
6 | 140443023243210 |
7 | 12363166331412 |
oct | 1731742401626 |
9 | 418511018386 |
10 | 132330947478 |
11 | 51137408504 |
12 | 21791449506 |
13 | c62ba93cb2 |
14 | 6594cb1d42 |
15 | 36977e9953 |
hex | 1ecf8a0396 |
132330947478 has 32 divisors (see below), whose sum is σ = 277598237184. Its totient is φ = 42004989792.
The previous prime is 132330947423. The next prime is 132330947491. The reversal of 132330947478 is 874749033231.
132330947478 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1323309474782 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 132330947478.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 6330900 + ... + 6351767.
It is an arithmetic number, because the mean of its divisors is an integer number (8674944912).
Almost surely, 2132330947478 is an apocalyptic number.
132330947478 is an abundant number, since it is smaller than the sum of its proper divisors (145267289706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132330947478 is a wasteful number, since it uses less digits than its factorization.
132330947478 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12682756.
The product of its (nonzero) digits is 3048192, while the sum is 51.
The spelling of 132330947478 in words is "one hundred thirty-two billion, three hundred thirty million, nine hundred forty-seven thousand, four hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •