Base | Representation |
---|---|
bin | 111100110001100010… |
… | …0110001101000010000 |
3 | 110110212112212122221011 |
4 | 1321203010301220100 |
5 | 4114241332340440 |
6 | 135542300140304 |
7 | 12300122011306 |
oct | 1714304615020 |
9 | 413775778834 |
10 | 130511215120 |
11 | 503931a6670 |
12 | 21363b37694 |
13 | c3cba855a0 |
14 | 6461340276 |
15 | 35dcb949ea |
hex | 1e63131a10 |
130511215120 has 80 divisors (see below), whose sum is σ = 356487308352. Its totient is φ = 43807956480.
The previous prime is 130511215067. The next prime is 130511215123. The reversal of 130511215120 is 21512115031.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1305112151202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 130511215091 and 130511215100.
It is not an unprimeable number, because it can be changed into a prime (130511215123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5692722 + ... + 5715601.
Almost surely, 2130511215120 is an apocalyptic number.
130511215120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130511215120 is an abundant number, since it is smaller than the sum of its proper divisors (225976093232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130511215120 is a wasteful number, since it uses less digits than its factorization.
130511215120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11408360 (or 11408354 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 22.
The spelling of 130511215120 in words is "one hundred thirty billion, five hundred eleven million, two hundred fifteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •