Base | Representation |
---|---|
bin | 11100001000101110… |
… | …111110011100100001 |
3 | 2212222110220012212121 |
4 | 130020232332130201 |
5 | 443333043200301 |
6 | 21513501024241 |
7 | 2116443561112 |
oct | 341056763441 |
9 | 85873805777 |
10 | 30211303201 |
11 | 118a3547282 |
12 | 5a31855081 |
13 | 2b060a9191 |
14 | 1668530209 |
15 | bbc4673a1 |
hex | 708bbe721 |
30211303201 has 4 divisors (see below), whose sum is σ = 30211921600. Its totient is φ = 30210684804.
The previous prime is 30211303189. The next prime is 30211303207. The reversal of 30211303201 is 10230311203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10230311203 = 7 ⋅1461473029.
It is a cyclic number.
It is not a de Polignac number, because 30211303201 - 29 = 30211302689 is a prime.
It is a super-2 number, since 2×302113032012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30211303207) 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, 228981 + ... + 335938.
It is an arithmetic number, because the mean of its divisors is an integer number (7552980400).
Almost surely, 230211303201 is an apocalyptic number.
It is an amenable number.
30211303201 is a deficient number, since it is larger than the sum of its proper divisors (618399).
30211303201 is an equidigital number, since it uses as much as digits as its factorization.
30211303201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 618398.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 30211303201 its reverse (10230311203), we get a palindrome (40441614404).
The spelling of 30211303201 in words is "thirty billion, two hundred eleven million, three hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •