Base | Representation |
---|---|
bin | 1111100010001… |
… | …00101111110100 |
3 | 100002012011212120 |
4 | 13301010233310 |
5 | 231324230022 |
6 | 20532515540 |
7 | 3141400665 |
oct | 761045764 |
9 | 302164776 |
10 | 130305012 |
11 | 676100a2 |
12 | 3777bbb0 |
13 | 20cc4576 |
14 | 1343d36c |
15 | b68dd5c |
hex | 7c44bf4 |
130305012 has 12 divisors (see below), whose sum is σ = 304045056. Its totient is φ = 43435000.
The previous prime is 130304969. The next prime is 130305013. The reversal of 130305012 is 210503031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 130304982 and 130305000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130305013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5429364 + ... + 5429387.
It is an arithmetic number, because the mean of its divisors is an integer number (25337088).
Almost surely, 2130305012 is an apocalyptic number.
130305012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130305012 is an abundant number, since it is smaller than the sum of its proper divisors (173740044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130305012 is a wasteful number, since it uses less digits than its factorization.
130305012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10858758 (or 10858756 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 130305012 is about 11415.1220755627. The cubic root of 130305012 is about 506.9755793551.
Adding to 130305012 its reverse (210503031), we get a palindrome (340808043).
The spelling of 130305012 in words is "one hundred thirty million, three hundred five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •