Base | Representation |
---|---|
bin | 111101000100000100… |
… | …1001000001110010000 |
3 | 110112110220002100202120 |
4 | 1322020021020032100 |
5 | 4122030034110412 |
6 | 140124113414240 |
7 | 12321413033322 |
oct | 1721011101620 |
9 | 415426070676 |
10 | 131133113232 |
11 | 50682250950 |
12 | 214b826a380 |
13 | c49a87a534 |
14 | 64bdb87612 |
15 | 362758ab8c |
hex | 1e88248390 |
131133113232 has 80 divisors (see below), whose sum is σ = 371414323200. Its totient is φ = 39537590400.
The previous prime is 131133113203. The next prime is 131133113249. The reversal of 131133113232 is 232311331131.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 518944 + ... + 729087.
It is an arithmetic number, because the mean of its divisors is an integer number (4642679040).
Almost surely, 2131133113232 is an apocalyptic number.
131133113232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131133113232 is an abundant number, since it is smaller than the sum of its proper divisors (240281209968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131133113232 is a wasteful number, since it uses less digits than its factorization.
131133113232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248252 (or 1248246 counting only the distinct ones).
The product of its digits is 972, while the sum is 24.
Adding to 131133113232 its reverse (232311331131), we get a palindrome (363444444363).
The spelling of 131133113232 in words is "one hundred thirty-one billion, one hundred thirty-three million, one hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •