Base | Representation |
---|---|
bin | 1101110001111000000010… |
… | …01000001101010001011011 |
3 | 10222021202012201010210002122 |
4 | 12320330001020031101123 |
5 | 12432422433334431021 |
6 | 144240032052451455 |
7 | 6245114232366356 |
oct | 670740110152133 |
9 | 128252181123078 |
10 | 30301013202011 |
11 | 9722651008a92 |
12 | 3494658019b8b |
13 | 13ba4b114b176 |
14 | 76a810cb529d |
15 | 3782eb3c5bab |
hex | 1b8f0120d45b |
30301013202011 has 8 divisors (see below), whose sum is σ = 30666922804224. Its totient is φ = 29935123532200.
The previous prime is 30301013201999. The next prime is 30301013202023. The reversal of 30301013202011 is 11020231010303.
It is an interprime number because it is at equal distance from previous prime (30301013201999) and next prime (30301013202023).
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 30301013202011 - 234 = 30283833332827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30301013232011) 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, 1913015 + ... + 8016336.
It is an arithmetic number, because the mean of its divisors is an integer number (3833365350528).
Almost surely, 230301013202011 is an apocalyptic number.
30301013202011 is a deficient number, since it is larger than the sum of its proper divisors (365909602213).
30301013202011 is an equidigital number, since it uses as much as digits as its factorization.
30301013202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9966201.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 30301013202011 its reverse (11020231010303), we get a palindrome (41321244212314).
The spelling of 30301013202011 in words is "thirty trillion, three hundred one billion, thirteen million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •