Base | Representation |
---|---|
bin | 100010000111101111000100… |
… | …0110100001001110101001000 |
3 | 1110100200011210200201001021000 |
4 | 1010033132020310021311020 |
5 | 303314313341123102222 |
6 | 2542153544024015000 |
7 | 120134461665226335 |
oct | 10417361064116510 |
9 | 1410604720631230 |
10 | 300130315050312 |
11 | 876a360851260a |
12 | 297b3323301460 |
13 | cb61223646946 |
14 | 5418555ab198c |
15 | 24a71291a59ac |
hex | 110f788d09d48 |
300130315050312 has 64 divisors (see below), whose sum is σ = 835930427904000. Its totient is φ = 99775225351872.
The previous prime is 300130315050289. The next prime is 300130315050403. The reversal of 300130315050312 is 213050513031003.
300130315050312 is a `hidden beast` number, since 3 + 0 + 0 + 1 + 3 + 0 + 3 + 150 + 503 + 1 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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, 1862509512 + ... + 1862670647.
It is an arithmetic number, because the mean of its divisors is an integer number (13061412936000).
Almost surely, 2300130315050312 is an apocalyptic number.
It is an amenable number.
300130315050312 is an abundant number, since it is smaller than the sum of its proper divisors (535800112853688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300130315050312 is a wasteful number, since it uses less digits than its factorization.
300130315050312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3725180547 (or 3725180537 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 300130315050312 its reverse (213050513031003), we get a palindrome (513180828081315).
The spelling of 300130315050312 in words is "three hundred trillion, one hundred thirty billion, three hundred fifteen million, fifty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •