Base | Representation |
---|---|
bin | 11110000001011111100101… |
… | …100001000001011011101100 |
3 | 122022112021201111111001202020 |
4 | 132001133211201001123230 |
5 | 114301402133214020022 |
6 | 1144500105015230140 |
7 | 36545603110000101 |
oct | 3601374541013354 |
9 | 568467644431666 |
10 | 132044030220012 |
11 | 39089616750a99 |
12 | 12987026678350 |
13 | 588a910b41681 |
14 | 2486d72598aa8 |
15 | 103eb7cca235c |
hex | 7817e58416ec |
132044030220012 has 48 divisors (see below), whose sum is σ = 315218552739552. Its totient is φ = 43005023493120.
The previous prime is 132044030219957. The next prime is 132044030220041. The reversal of 132044030220012 is 210022030440231.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 430586143 + ... + 430892694.
It is an arithmetic number, because the mean of its divisors is an integer number (6567053182074).
Almost surely, 2132044030220012 is an apocalyptic number.
132044030220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132044030220012 is an abundant number, since it is smaller than the sum of its proper divisors (183174522519540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132044030220012 is a wasteful number, since it uses less digits than its factorization.
132044030220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861479138 (or 861479136 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 132044030220012 its reverse (210022030440231), we get a palindrome (342066060660243).
The spelling of 132044030220012 in words is "one hundred thirty-two trillion, forty-four billion, thirty million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •