Base | Representation |
---|---|
bin | 111101001001000101… |
… | …0000001100001111000 |
3 | 110112220121012222212220 |
4 | 1322102022001201320 |
5 | 4122401041320440 |
6 | 140152514404040 |
7 | 12325523051322 |
oct | 1722212014170 |
9 | 415817188786 |
10 | 131301120120 |
11 | 50759071a15 |
12 | 21544590620 |
13 | c4c66125b1 |
14 | 64d81dc612 |
15 | 36371c58d0 |
hex | 1e92281878 |
131301120120 has 32 divisors (see below), whose sum is σ = 393903360720. Its totient is φ = 35013632000.
The previous prime is 131301120107. The next prime is 131301120127. The reversal of 131301120120 is 21021103131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 131301120120.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131301120127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 547087881 + ... + 547088120.
Almost surely, 2131301120120 is an apocalyptic number.
131301120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131301120120 is an abundant number, since it is smaller than the sum of its proper divisors (262602240600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131301120120 is a wasteful number, since it uses less digits than its factorization.
131301120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094176015 (or 1094176011 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 131301120120 its reverse (21021103131), we get a palindrome (152322223251).
The spelling of 131301120120 in words is "one hundred thirty-one billion, three hundred one million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •