Base | Representation |
---|---|
bin | 11100001001010100… |
… | …011000101101011111 |
3 | 2220000011100110102111 |
4 | 130021110120231133 |
5 | 443343101010421 |
6 | 21514451134451 |
7 | 2116623124513 |
oct | 341124305537 |
9 | 86004313374 |
10 | 30221110111 |
11 | 118a9035365 |
12 | 5a34ba4427 |
13 | 2b08130b9a |
14 | 1669964143 |
15 | bbd252ee1 |
hex | 709518b5f |
30221110111 has 4 divisors (see below), whose sum is σ = 30263735800. Its totient is φ = 30178484424.
The previous prime is 30221110099. The next prime is 30221110123. The reversal of 30221110111 is 11101112203.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (30221110099) and next prime (30221110123).
It is a cyclic number.
It is not a de Polignac number, because 30221110111 - 27 = 30221109983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30221110091 and 30221110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30221110181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21311781 + ... + 21313198.
It is an arithmetic number, because the mean of its divisors is an integer number (7565933950).
Almost surely, 230221110111 is an apocalyptic number.
30221110111 is a deficient number, since it is larger than the sum of its proper divisors (42625689).
30221110111 is an equidigital number, since it uses as much as digits as its factorization.
30221110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42625688.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 30221110111 its reverse (11101112203), we get a palindrome (41322222314).
The spelling of 30221110111 in words is "thirty billion, two hundred twenty-one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •