Base | Representation |
---|---|
bin | 11110000000110111101110… |
… | …000000111011111110011000 |
3 | 122022101012020012101122002020 |
4 | 132000313232000323332120 |
5 | 114300202001110143112 |
6 | 1144424305202534440 |
7 | 36542526235514313 |
oct | 3600675600737630 |
9 | 568335205348066 |
10 | 132001223131032 |
11 | 3907244a213502 |
12 | 1297a87a667420 |
13 | 588687b34c318 |
14 | 2484c7127d97a |
15 | 103d9c4b3048c |
hex | 780dee03bf98 |
132001223131032 has 64 divisors (see below), whose sum is σ = 330407420911200. Its totient is φ = 43946516490240.
The previous prime is 132001223130989. The next prime is 132001223131079. The reversal of 132001223131032 is 230131322100231.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 132001223130993 and 132001223131011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88052128 + ... + 89538704.
Almost surely, 2132001223131032 is an apocalyptic number.
132001223131032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132001223131032 is an abundant number, since it is smaller than the sum of its proper divisors (198406197780168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132001223131032 is a wasteful number, since it uses less digits than its factorization.
132001223131032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1491116 (or 1491112 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 132001223131032 its reverse (230131322100231), we get a palindrome (362132545231263).
The spelling of 132001223131032 in words is "one hundred thirty-two trillion, one billion, two hundred twenty-three million, one hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •