Base | Representation |
---|---|
bin | 111100101011010101… |
… | …0100011000100000000 |
3 | 110110100001002220110222 |
4 | 1321112222203010000 |
5 | 4113330032404440 |
6 | 135505501442212 |
7 | 12262013223350 |
oct | 1712652430400 |
9 | 413301086428 |
10 | 130303013120 |
11 | 502967213a5 |
12 | 21306270368 |
13 | c3978b8c37 |
14 | 6441824b60 |
15 | 35c976a2b5 |
hex | 1e56aa3100 |
130303013120 has 144 divisors (see below), whose sum is σ = 356970112128. Its totient is φ = 44642058240.
The previous prime is 130303013119. The next prime is 130303013299. The reversal of 130303013120 is 21310303031.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14071532 + ... + 14080788.
It is an arithmetic number, because the mean of its divisors is an integer number (2478959112).
Almost surely, 2130303013120 is an apocalyptic number.
130303013120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130303013120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178485056064).
130303013120 is an abundant number, since it is smaller than the sum of its proper divisors (226667099008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130303013120 is an equidigital number, since it uses as much as digits as its factorization.
130303013120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10856 (or 10842 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 130303013120 its reverse (21310303031), we get a palindrome (151613316151).
The spelling of 130303013120 in words is "one hundred thirty billion, three hundred three million, thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •