Base | Representation |
---|---|
bin | 11101110010100111111011… |
… | …101101001110111001100000 |
3 | 122011220121012102012222001201 |
4 | 131302213323231032321200 |
5 | 114133131431234200300 |
6 | 1142354433510010544 |
7 | 36412020160005523 |
oct | 3562477355167140 |
9 | 564817172188051 |
10 | 131022200303200 |
11 | 38825226369538 |
12 | 12840b91946a54 |
13 | 5815457034cbb |
14 | 244d718c06bba |
15 | 10232c4d0766a |
hex | 7729fbb4ee60 |
131022200303200 has 36 divisors (see below), whose sum is σ = 319857946492140. Its totient is φ = 52408880120960.
The previous prime is 131022200303191. The next prime is 131022200303207. The reversal of 131022200303200 is 2303002220131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131022200303207) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 81888874390 + ... + 81888875989.
It is an arithmetic number, because the mean of its divisors is an integer number (8884942958115).
Almost surely, 2131022200303200 is an apocalyptic number.
131022200303200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131022200303200 is an abundant number, since it is smaller than the sum of its proper divisors (188835746188940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131022200303200 is a wasteful number, since it uses less digits than its factorization.
131022200303200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163777750399 (or 163777750386 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 131022200303200 its reverse (2303002220131), we get a palindrome (133325202523331).
The spelling of 131022200303200 in words is "one hundred thirty-one trillion, twenty-two billion, two hundred million, three hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •