Base | Representation |
---|---|
bin | 111101000110101100… |
… | …0011011101010110000 |
3 | 110112201000111000222220 |
4 | 1322031120123222300 |
5 | 4122220034323440 |
6 | 140140533401040 |
7 | 12323531122353 |
oct | 1721530335260 |
9 | 415630430886 |
10 | 131221011120 |
11 | 50717926931 |
12 | 21521799180 |
13 | c4b2b44714 |
14 | 64cb70829a |
15 | 363014e8d0 |
hex | 1e8d61bab0 |
131221011120 has 80 divisors (see below), whose sum is σ = 406947739392. Its totient is φ = 34978282240.
The previous prime is 131221011067. The next prime is 131221011139. The reversal of 131221011120 is 21110122131.
It is a tau number, because it is divible by the number of its divisors (80).
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 131221011120.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 499429 + ... + 715451.
Almost surely, 2131221011120 is an apocalyptic number.
131221011120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131221011120 is an abundant number, since it is smaller than the sum of its proper divisors (275726728272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131221011120 is a wasteful number, since it uses less digits than its factorization.
131221011120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218570 (or 218564 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 131221011120 its reverse (21110122131), we get a palindrome (152331133251).
The spelling of 131221011120 in words is "one hundred thirty-one billion, two hundred twenty-one million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •