Base | Representation |
---|---|
bin | 100010001110010010000010… |
… | …0000101010001010110100001 |
3 | 1110110212012010110120010020120 |
4 | 1010130210010011101112201 |
5 | 303424034001003100001 |
6 | 2544123142013430453 |
7 | 120256462542166443 |
oct | 10434440405212641 |
9 | 1413765113503216 |
10 | 301030031300001 |
11 | 87a10134917613 |
12 | 2991977849b429 |
13 | cbc80193a4353 |
14 | 5449d07514493 |
15 | 24c0736833236 |
hex | 111c9041515a1 |
301030031300001 has 8 divisors (see below), whose sum is σ = 408176313627360. Its totient is φ = 197285218252992.
The previous prime is 301030031299979. The next prime is 301030031300003. The reversal of 301030031300001 is 100003130030103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 301030031300001 - 29 = 301030031299489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (301030031300003) by changing a digit.
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, 850367319880 + ... + 850367320233.
It is an arithmetic number, because the mean of its divisors is an integer number (51022039203420).
Almost surely, 2301030031300001 is an apocalyptic number.
It is an amenable number.
301030031300001 is a deficient number, since it is larger than the sum of its proper divisors (107146282327359).
301030031300001 is a wasteful number, since it uses less digits than its factorization.
301030031300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700734640175.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 301030031300001 its reverse (100003130030103), we get a palindrome (401033161330104).
The spelling of 301030031300001 in words is "three hundred one trillion, thirty billion, thirty-one million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •