Base | Representation |
---|---|
bin | 111101011110001111… |
… | …1001110001011010110 |
3 | 110121202002120212222222 |
4 | 1322330133032023112 |
5 | 4130324344220042 |
6 | 140351204422342 |
7 | 12352235464061 |
oct | 1727437161326 |
9 | 417662525888 |
10 | 132011320022 |
11 | 50a92a4868a |
12 | 217023a79b2 |
13 | c5aa7b351a |
14 | 656466d8d8 |
15 | 36797102d2 |
hex | 1ebc7ce2d6 |
132011320022 has 32 divisors (see below), whose sum is σ = 211238165952. Its totient is φ = 61658097664.
The previous prime is 132011319997. The next prime is 132011320027. The reversal of 132011320022 is 220023110231.
It is a super-2 number, since 2×1320113200222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132011320027) by changing a digit.
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, 3469103 + ... + 3506949.
It is an arithmetic number, because the mean of its divisors is an integer number (6601192686).
Almost surely, 2132011320022 is an apocalyptic number.
132011320022 is a deficient number, since it is larger than the sum of its proper divisors (79226845930).
132011320022 is a wasteful number, since it uses less digits than its factorization.
132011320022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38632.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 132011320022 its reverse (220023110231), we get a palindrome (352034430253).
The spelling of 132011320022 in words is "one hundred thirty-two billion, eleven million, three hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •