Base | Representation |
---|---|
bin | 1101101001001101001011… |
… | …11101110100110011111101 |
3 | 10221020021022210020120011121 |
4 | 12310212211331310303331 |
5 | 12413032403014312201 |
6 | 143451125331350541 |
7 | 6214440361501141 |
oct | 664464575646375 |
9 | 127207283216147 |
10 | 30003131010301 |
11 | 9618290303479 |
12 | 3446983a52451 |
13 | 139838b004077 |
14 | 75a233137221 |
15 | 3706b4aea9a1 |
hex | 1b49a5f74cfd |
30003131010301 has 8 divisors (see below), whose sum is σ = 30137978393600. Its totient is φ = 29868286343472.
The previous prime is 30003131010299. The next prime is 30003131010331. The reversal of 30003131010301 is 10301013130003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30003131010301 - 21 = 30003131010299 is a prime.
It is a super-2 number, since 2×300031310103012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30003131010331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23369371 + ... + 24619783.
It is an arithmetic number, because the mean of its divisors is an integer number (3767247299200).
Almost surely, 230003131010301 is an apocalyptic number.
It is an amenable number.
30003131010301 is a deficient number, since it is larger than the sum of its proper divisors (134847383299).
30003131010301 is a wasteful number, since it uses less digits than its factorization.
30003131010301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1358235.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 30003131010301 its reverse (10301013130003), we get a palindrome (40304144140304).
The spelling of 30003131010301 in words is "thirty trillion, three billion, one hundred thirty-one million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •