Base | Representation |
---|---|
bin | 10101011101010011… |
… | …11001001001000010 |
3 | 1002201212012100211010 |
4 | 22232221321021002 |
5 | 142043124332010 |
6 | 5143044501350 |
7 | 555323451234 |
oct | 125651711102 |
9 | 32655170733 |
10 | 11520152130 |
11 | 4981909893 |
12 | 22960aa856 |
13 | 1117917186 |
14 | 7b3dd0254 |
15 | 476588620 |
hex | 2aea79242 |
11520152130 has 16 divisors (see below), whose sum is σ = 27648365184. Its totient is φ = 3072040560.
The previous prime is 11520152113. The next prime is 11520152173. The reversal of 11520152130 is 3125102511.
11520152130 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11520152097 and 11520152106.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192002506 + ... + 192002565.
It is an arithmetic number, because the mean of its divisors is an integer number (1728022824).
Almost surely, 211520152130 is an apocalyptic number.
11520152130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11520152130 is an abundant number, since it is smaller than the sum of its proper divisors (16128213054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11520152130 is a wasteful number, since it uses less digits than its factorization.
11520152130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 384005081.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 11520152130 its reverse (3125102511), we get a palindrome (14645254641).
It can be divided in two parts, 115201 and 52130, that added together give a triangular number (167331 = T578).
The spelling of 11520152130 in words is "eleven billion, five hundred twenty million, one hundred fifty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •