Base | Representation |
---|---|
bin | 11101110101001111110010… |
… | …010011010010010101101000 |
3 | 122012112211102000022202022102 |
4 | 131311033302103102111220 |
5 | 114144110034332224112 |
6 | 1143013321554112532 |
7 | 36431030360536100 |
oct | 3565176223222550 |
9 | 565484360282272 |
10 | 131202431133032 |
11 | 38894702a30576 |
12 | 1286bab087b748 |
13 | 582944a73943c |
14 | 245833552c200 |
15 | 1027d22909bc2 |
hex | 7753f24d2568 |
131202431133032 has 96 divisors (see below), whose sum is σ = 296889589461600. Its totient is φ = 54134202294144.
The previous prime is 131202431133023. The next prime is 131202431133047. The reversal of 131202431133032 is 230331134202131.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 131202431132986 and 131202431133004.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12685538 + ... + 20574929.
It is an arithmetic number, because the mean of its divisors is an integer number (3092599890225).
Almost surely, 2131202431133032 is an apocalyptic number.
It is an amenable number.
131202431133032 is an abundant number, since it is smaller than the sum of its proper divisors (165687158328568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131202431133032 is a wasteful number, since it uses less digits than its factorization.
131202431133032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33260863 (or 33260852 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 131202431133032 its reverse (230331134202131), we get a palindrome (361533565335163).
The spelling of 131202431133032 in words is "one hundred thirty-one trillion, two hundred two billion, four hundred thirty-one million, one hundred thirty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •