Base | Representation |
---|---|
bin | 1101110001111000011100… |
… | …00100000010100001011011 |
3 | 10222021202202211111002111111 |
4 | 12320330032010002201123 |
5 | 12432423404413310321 |
6 | 144240105404041151 |
7 | 6245122506064156 |
oct | 670741604024133 |
9 | 128252684432444 |
10 | 30301230213211 |
11 | 972275255a791 |
12 | 34946b88331b7 |
13 | 13ba5170b0369 |
14 | 76a831a44c9d |
15 | 3783104905e1 |
hex | 1b8f0e10285b |
30301230213211 has 8 divisors (see below), whose sum is σ = 32574670778880. Its totient is φ = 28095653545128.
The previous prime is 30301230213193. The next prime is 30301230213223. The reversal of 30301230213211 is 11231203210303.
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 30301230213211 - 29 = 30301230212699 is a prime.
It is a super-2 number, since 2×303012302132112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30301230213311) 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, 16965973471 + ... + 16965975256.
It is an arithmetic number, because the mean of its divisors is an integer number (4071833847360).
Almost surely, 230301230213211 is an apocalyptic number.
30301230213211 is a deficient number, since it is larger than the sum of its proper divisors (2273440565669).
30301230213211 is a wasteful number, since it uses less digits than its factorization.
30301230213211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33931948793.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30301230213211 its reverse (11231203210303), we get a palindrome (41532433423514).
The spelling of 30301230213211 in words is "thirty trillion, three hundred one billion, two hundred thirty million, two hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •