Base | Representation |
---|---|
bin | 1101110001111000000011… |
… | …00110011010100111101001 |
3 | 10222021202020021001002220120 |
4 | 12320330001212122213221 |
5 | 12432422442401333001 |
6 | 144240032534313453 |
7 | 6245114356610661 |
oct | 670740146324751 |
9 | 128252207032816 |
10 | 30301021121001 |
11 | 9722655527704 |
12 | 349465a7b8889 |
13 | 13ba4b2991767 |
14 | 76a811d771a1 |
15 | 3782ebe3c236 |
hex | 1b8f0199a9e9 |
30301021121001 has 8 divisors (see below), whose sum is σ = 40489000024704. Its totient is φ = 20156861482320.
The previous prime is 30301021120969. The next prime is 30301021121027. The reversal of 30301021121001 is 10012112010303.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30301021121001 - 25 = 30301021120969 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30301021121051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10954814641 + ... + 10954817406.
It is an arithmetic number, because the mean of its divisors is an integer number (5061125003088).
Almost surely, 230301021121001 is an apocalyptic number.
It is an amenable number.
30301021121001 is a deficient number, since it is larger than the sum of its proper divisors (10187978903703).
30301021121001 is a wasteful number, since it uses less digits than its factorization.
30301021121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21909632511.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 30301021121001 its reverse (10012112010303), we get a palindrome (40313133131304).
The spelling of 30301021121001 in words is "thirty trillion, three hundred one billion, twenty-one million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •