Base | Representation |
---|---|
bin | 11100001001010101… |
… | …001100001111111101 |
3 | 2220000011202012000002 |
4 | 130021111030033331 |
5 | 443343124234323 |
6 | 21514455444045 |
7 | 2116624664126 |
oct | 341125141775 |
9 | 86004665002 |
10 | 30221321213 |
11 | 118a9169a26 |
12 | 5a35086625 |
13 | 2b081a5cb5 |
14 | 16699bb04d |
15 | bbd295828 |
hex | 70954c3fd |
30221321213 has 4 divisors (see below), whose sum is σ = 30324465948. Its totient is φ = 30118176480.
The previous prime is 30221321177. The next prime is 30221321233. The reversal of 30221321213 is 31212312203.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 20049993604 + 10171327609 = 141598^2 + 100853^2 .
It is a cyclic number.
It is not a de Polignac number, because 30221321213 - 28 = 30221320957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30221321233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51571928 + ... + 51572513.
It is an arithmetic number, because the mean of its divisors is an integer number (7581116487).
Almost surely, 230221321213 is an apocalyptic number.
It is an amenable number.
30221321213 is a deficient number, since it is larger than the sum of its proper divisors (103144735).
30221321213 is a wasteful number, since it uses less digits than its factorization.
30221321213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103144734.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30221321213 its reverse (31212312203), we get a palindrome (61433633416).
The spelling of 30221321213 in words is "thirty billion, two hundred twenty-one million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •