Base | Representation |
---|---|
bin | 1101110001110110011001… |
… | …00100000110110101001011 |
3 | 10222021122221020201200210212 |
4 | 12320323030210012311023 |
5 | 12432414132104320321 |
6 | 144235404351031335 |
7 | 6245053333503221 |
oct | 670731444066513 |
9 | 128248836650725 |
10 | 30300131323211 |
11 | 9722239233432 |
12 | 349445080b54b |
13 | 13ba3a052a9a9 |
14 | 76a769b14b11 |
15 | 378298c7855b |
hex | 1b8ecc906d4b |
30300131323211 has 8 divisors (see below), whose sum is σ = 30307896009600. Its totient is φ = 30292367414400.
The previous prime is 30300131323183. The next prime is 30300131323247. The reversal of 30300131323211 is 11232313100303.
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 30300131323211 - 214 = 30300131306827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30300131323261) 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, 82173725 + ... + 82541633.
It is an arithmetic number, because the mean of its divisors is an integer number (3788487001200).
Almost surely, 230300131323211 is an apocalyptic number.
30300131323211 is a deficient number, since it is larger than the sum of its proper divisors (7764686389).
30300131323211 is a wasteful number, since it uses less digits than its factorization.
30300131323211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388789.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 30300131323211 its reverse (11232313100303), we get a palindrome (41532444423514).
The spelling of 30300131323211 in words is "thirty trillion, three hundred billion, one hundred thirty-one million, three hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •