Base | Representation |
---|---|
bin | 1101101001011100010000… |
… | …00111101011110111011101 |
3 | 10221021001012112111122110110 |
4 | 12310232020013223313131 |
5 | 12413200434333310323 |
6 | 143454544135200233 |
7 | 6215145004544121 |
oct | 664561007536735 |
9 | 127231175448413 |
10 | 30011220213213 |
11 | 9620761468338 |
12 | 3448460b16079 |
13 | 1399079b7a375 |
14 | 75a79d5c1581 |
15 | 3709d9d66793 |
hex | 1b4b881ebddd |
30011220213213 has 8 divisors (see below), whose sum is σ = 40015203124000. Its totient is φ = 20007358722288.
The previous prime is 30011220213197. The next prime is 30011220213223. The reversal of 30011220213213 is 31231202211003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30011220213213 - 24 = 30011220213197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30011220213213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30011220213223) 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, 29776663 + ... + 30768036.
It is an arithmetic number, because the mean of its divisors is an integer number (5001900390500).
Almost surely, 230011220213213 is an apocalyptic number.
It is an amenable number.
30011220213213 is a deficient number, since it is larger than the sum of its proper divisors (10003982910787).
30011220213213 is a wasteful number, since it uses less digits than its factorization.
30011220213213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60709931.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 30011220213213 its reverse (31231202211003), we get a palindrome (61242422424216).
The spelling of 30011220213213 in words is "thirty trillion, eleven billion, two hundred twenty million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •