Base | Representation |
---|---|
bin | 11100001001010111… |
… | …110100101101000001 |
3 | 2220000020001020111012 |
4 | 130021113310231001 |
5 | 443343313324301 |
6 | 21514522330305 |
7 | 2116633566554 |
oct | 341127645501 |
9 | 86006036435 |
10 | 30222011201 |
11 | 118a95a0368 |
12 | 5a35359995 |
13 | 2b08388085 |
14 | 1669b1a69b |
15 | bbd37eebb |
hex | 7095f4b41 |
30222011201 has 4 divisors (see below), whose sum is σ = 31536011712. Its totient is φ = 28908010692.
The previous prime is 30222011153. The next prime is 30222011203. The reversal of 30222011201 is 10211022203.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 30222011201 - 218 = 30221749057 is a prime.
It is a super-2 number, since 2×302220112012 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30222011203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 657000221 + ... + 657000266.
It is an arithmetic number, because the mean of its divisors is an integer number (7884002928).
Almost surely, 230222011201 is an apocalyptic number.
It is an amenable number.
30222011201 is a deficient number, since it is larger than the sum of its proper divisors (1314000511).
30222011201 is a wasteful number, since it uses less digits than its factorization.
30222011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1314000510.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 30222011201 its reverse (10211022203), we get a palindrome (40433033404).
The spelling of 30222011201 in words is "thirty billion, two hundred twenty-two million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •