Base | Representation |
---|---|
bin | 100010000110110010011110… |
… | …1011011010101001001110101 |
3 | 1110100012201221211121021122200 |
4 | 1010031210331123111021311 |
5 | 303310200403003424023 |
6 | 2542014105001215113 |
7 | 120122204440101201 |
oct | 10415447533251165 |
9 | 1410181854537580 |
10 | 300000201233013 |
11 | 876534096748a6 |
12 | 29792070491499 |
13 | cb51b890013c8 |
14 | 5412131459b01 |
15 | 24a3a6135d743 |
hex | 110d93d6d5275 |
300000201233013 has 12 divisors (see below), whose sum is σ = 452174216351520. Its totient is φ = 191304476148456.
The previous prime is 300000201232997. The next prime is 300000201233017. The reversal of 300000201233013 is 310332102000003.
300000201233013 is a `hidden beast` number, since 300 + 0 + 0 + 0 + 20 + 1 + 2 + 330 + 13 = 666.
It is not a de Polignac number, because 300000201233013 - 24 = 300000201232997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300000201233017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 724638167023 + ... + 724638167436.
It is an arithmetic number, because the mean of its divisors is an integer number (37681184695960).
Almost surely, 2300000201233013 is an apocalyptic number.
It is an amenable number.
300000201233013 is a deficient number, since it is larger than the sum of its proper divisors (152174015118507).
300000201233013 is a wasteful number, since it uses less digits than its factorization.
300000201233013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1449276334488 (or 1449276334485 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 300000201233013 its reverse (310332102000003), we get a palindrome (610332303233016).
The spelling of 300000201233013 in words is "three hundred trillion, two hundred one million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •