Base | Representation |
---|---|
bin | 100010000110110010110110… |
… | …1101000100010010110010100 |
3 | 1110100012211001012102222011200 |
4 | 1010031211231220202112110 |
5 | 303310204032030020200 |
6 | 2542014321132032500 |
7 | 120122233460364216 |
oct | 10415455550422624 |
9 | 1410184035388150 |
10 | 300001010001300 |
11 | 87653794154443 |
12 | 29792257302730 |
13 | cb51c8773431a |
14 | 54121aaa285b6 |
15 | 24a3aac368800 |
hex | 110d96da22594 |
300001010001300 has 54 divisors (see below), whose sum is σ = 940336499129118. Its totient is φ = 80000269333440.
The previous prime is 300001010001293. The next prime is 300001010001311. The reversal of 300001010001300 is 3100010100003.
It can be written as a sum of positive squares in 3 ways, for example, as 76329961836804 + 223671048164496 = 8736702^2 + 14955636^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 166667226879 + ... + 166667228678.
Almost surely, 2300001010001300 is an apocalyptic number.
300001010001300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
300001010001300 is an abundant number, since it is smaller than the sum of its proper divisors (640335489127818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300001010001300 is a wasteful number, since it uses less digits than its factorization.
300001010001300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333334455577 (or 333334455567 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
Adding to 300001010001300 its reverse (3100010100003), we get a palindrome (303101020101303).
The spelling of 300001010001300 in words is "three hundred trillion, one billion, ten million, one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •