Base | Representation |
---|---|
bin | 111101001100001000… |
… | …0100111101010110100 |
3 | 110120011201220001211021 |
4 | 1322120100213222310 |
5 | 4123103244400000 |
6 | 140211013150524 |
7 | 12331205266351 |
oct | 1723020475264 |
9 | 416151801737 |
10 | 131403512500 |
11 | 50800947917 |
12 | 2157292b444 |
13 | c5118b2cc0 |
14 | 6507a53628 |
15 | 364119e11a |
hex | 1e98427ab4 |
131403512500 has 72 divisors (see below), whose sum is σ = 309536922744. Its totient is φ = 48518160000.
The previous prime is 131403512497. The next prime is 131403512533. The reversal of 131403512500 is 5215304131.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 130850039824 + 553472676 = 361732^2 + 23526^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
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, 241819 + ... + 566818.
It is an arithmetic number, because the mean of its divisors is an integer number (4299123927).
Almost surely, 2131403512500 is an apocalyptic number.
131403512500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131403512500 is an abundant number, since it is smaller than the sum of its proper divisors (178133410244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131403512500 is an equidigital number, since it uses as much as digits as its factorization.
131403512500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 808679 (or 808657 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 131403512500 its reverse (5215304131), we get a palindrome (136618816631).
The spelling of 131403512500 in words is "one hundred thirty-one billion, four hundred three million, five hundred twelve thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •