Base | Representation |
---|---|
bin | 1111100100100… |
… | …01101001101111 |
3 | 100002210011222100 |
4 | 13302101221233 |
5 | 231414320030 |
6 | 20543350143 |
7 | 3144152241 |
oct | 762215157 |
9 | 302704870 |
10 | 130620015 |
11 | 67805829 |
12 | 378b2353 |
13 | 210a4a66 |
14 | 134c2091 |
15 | b702360 |
hex | 7c91a6f |
130620015 has 24 divisors (see below), whose sum is σ = 226716048. Its totient is φ = 69569280.
The previous prime is 130619999. The next prime is 130620023. The reversal of 130620015 is 510026031.
130620015 is a `hidden beast` number, since 1 + 30 + 620 + 0 + 15 = 666.
It is not a de Polignac number, because 130620015 - 24 = 130619999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130620015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42480 + ... + 45450.
It is an arithmetic number, because the mean of its divisors is an integer number (9446502).
Almost surely, 2130620015 is an apocalyptic number.
130620015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130620015 is a deficient number, since it is larger than the sum of its proper divisors (96096033).
130620015 is a wasteful number, since it uses less digits than its factorization.
130620015 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3959 (or 3956 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 130620015 is about 11428.9113654801. The cubic root of 130620015 is about 507.3837762763.
Adding to 130620015 its reverse (510026031), we get a palindrome (640646046).
It can be divided in two parts, 1306 and 20015, that added together give a triangular number (21321 = T206).
The spelling of 130620015 in words is "one hundred thirty million, six hundred twenty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •