Base | Representation |
---|---|
bin | 11101101000000111100001… |
… | …010100001011000000100000 |
3 | 122002100120121011221211001001 |
4 | 131220013201110023000200 |
5 | 114034314303433122240 |
6 | 1141043030434321344 |
7 | 36305610333241114 |
oct | 3550074124130040 |
9 | 562316534854031 |
10 | 130300203020320 |
11 | 3857700775a713 |
12 | 12745076429254 |
13 | 5792344487a58 |
14 | 24267c626b744 |
15 | 100e6199ab89a |
hex | 7681e150b020 |
130300203020320 has 48 divisors (see below), whose sum is σ = 307834971454080. Its totient is φ = 52119955609344.
The previous prime is 130300203020297. The next prime is 130300203020347. The reversal of 130300203020320 is 23020302003031.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94666969 + ... + 96033511.
It is an arithmetic number, because the mean of its divisors is an integer number (6413228571960).
Almost surely, 2130300203020320 is an apocalyptic number.
130300203020320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130300203020320 is an abundant number, since it is smaller than the sum of its proper divisors (177534768433760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130300203020320 is a wasteful number, since it uses less digits than its factorization.
130300203020320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1962497 (or 1962489 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 130300203020320 its reverse (23020302003031), we get a palindrome (153320505023351).
The spelling of 130300203020320 in words is "one hundred thirty trillion, three hundred billion, two hundred three million, twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •