Base | Representation |
---|---|
bin | 11101110101001111100100… |
… | …100001101010111111011000 |
3 | 122012112210210220110010221121 |
4 | 131311033210201222333120 |
5 | 114144104101201214000 |
6 | 1143013243020415024 |
7 | 36431021553250651 |
oct | 3565174441527730 |
9 | 565483726403847 |
10 | 131202200023000 |
11 | 388945a452a147 |
12 | 1286ba473a7474 |
13 | 58294118abb42 |
14 | 245831296c528 |
15 | 1027d0c4a7b1a |
hex | 7753e486afd8 |
131202200023000 has 96 divisors (see below), whose sum is σ = 317236272893280. Its totient is φ = 50787948024000.
The previous prime is 131202200022953. The next prime is 131202200023007. The reversal of 131202200023000 is 320002202131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131202200023007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67302372 + ... + 69224371.
It is an arithmetic number, because the mean of its divisors is an integer number (3304544509305).
Almost surely, 2131202200023000 is an apocalyptic number.
131202200023000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131202200023000 is an abundant number, since it is smaller than the sum of its proper divisors (186034072870280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131202200023000 is a wasteful number, since it uses less digits than its factorization.
131202200023000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136526826 (or 136526781 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 131202200023000 its reverse (320002202131), we get a palindrome (131522202225131).
The spelling of 131202200023000 in words is "one hundred thirty-one trillion, two hundred two billion, two hundred million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •