Base | Representation |
---|---|
bin | 111101001100101010… |
… | …1010110101111110000 |
3 | 110120012222210111201120 |
4 | 1322121111112233300 |
5 | 4123122402443440 |
6 | 140212455302240 |
7 | 12331514403645 |
oct | 1723125265760 |
9 | 416188714646 |
10 | 131421531120 |
11 | 50810034540 |
12 | 2157897a980 |
13 | c5155515c9 |
14 | 650a1c3dcc |
15 | 3642a5cdd0 |
hex | 1e99556bf0 |
131421531120 has 160 divisors (see below), whose sum is σ = 444638398464. Its totient is φ = 31845811200.
The previous prime is 131421531119. The next prime is 131421531181. The reversal of 131421531120 is 21135124131.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6830634 + ... + 6849846.
Almost surely, 2131421531120 is an apocalyptic number.
131421531120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131421531120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222319199232).
131421531120 is an abundant number, since it is smaller than the sum of its proper divisors (313216867344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131421531120 is a wasteful number, since it uses less digits than its factorization.
131421531120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21831 (or 21825 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 131421531120 its reverse (21135124131), we get a palindrome (152556655251).
The spelling of 131421531120 in words is "one hundred thirty-one billion, four hundred twenty-one million, five hundred thirty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •