Base | Representation |
---|---|
bin | 11100000010010010… |
… | …100110100110011001 |
3 | 2212200221111010011212 |
4 | 130002102212212121 |
5 | 443122404432301 |
6 | 21455040032505 |
7 | 2113661665622 |
oct | 340222464631 |
9 | 85627433155 |
10 | 30103202201 |
11 | 11848522406 |
12 | 5a01602735 |
13 | 2ab988a2a7 |
14 | 1658030a49 |
15 | bb2c124bb |
hex | 7024a6999 |
30103202201 has 4 divisors (see below), whose sum is σ = 30256010532. Its totient is φ = 29950393872.
The previous prime is 30103202053. The next prime is 30103202243. The reversal of 30103202201 is 10220230103.
It is a happy number.
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 24342240400 + 5760961801 = 156020^2 + 75901^2 .
It is a cyclic number.
It is not a de Polignac number, because 30103202201 - 214 = 30103185817 is a prime.
It is a super-5 number, since 5×301032022015 (a number of 54 digits) contains 55555 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30103202291) 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, 76403870 + ... + 76404263.
It is an arithmetic number, because the mean of its divisors is an integer number (7564002633).
Almost surely, 230103202201 is an apocalyptic number.
It is an amenable number.
30103202201 is a deficient number, since it is larger than the sum of its proper divisors (152808331).
30103202201 is a wasteful number, since it uses less digits than its factorization.
30103202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152808330.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 30103202201 its reverse (10220230103), we get a palindrome (40323432304).
The spelling of 30103202201 in words is "thirty billion, one hundred three million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •