Base | Representation |
---|---|
bin | 11100001000110010… |
… | …000110011000001001 |
3 | 2212222112102211012222 |
4 | 130020302012120021 |
5 | 443333300401441 |
6 | 21513530343425 |
7 | 2116453541456 |
oct | 341062063011 |
9 | 85875384188 |
10 | 30212122121 |
11 | 118a3a56575 |
12 | 5a31b8ab75 |
13 | 2b06304b4c |
14 | 16686a482d |
15 | bbc579d4b |
hex | 708c86609 |
30212122121 has 4 divisors (see below), whose sum is σ = 31525692672. Its totient is φ = 28898551572.
The previous prime is 30212122103. The next prime is 30212122133. The reversal of 30212122121 is 12122121203.
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 not a de Polignac number, because 30212122121 - 222 = 30207927817 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30212122121.
It is not an unprimeable number, because it can be changed into a prime (30212122181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 656785241 + ... + 656785286.
It is an arithmetic number, because the mean of its divisors is an integer number (7881423168).
Almost surely, 230212122121 is an apocalyptic number.
It is an amenable number.
30212122121 is a deficient number, since it is larger than the sum of its proper divisors (1313570551).
30212122121 is a wasteful number, since it uses less digits than its factorization.
30212122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1313570550.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 30212122121 its reverse (12122121203), we get a palindrome (42334243324).
The spelling of 30212122121 in words is "thirty billion, two hundred twelve million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •