Base | Representation |
---|---|
bin | 11100001000110010… |
… | …110010010111111011 |
3 | 2212222112202222102102 |
4 | 130020302302113323 |
5 | 443333322133311 |
6 | 21513534254015 |
7 | 2116455222041 |
oct | 341062622773 |
9 | 85875688372 |
10 | 30212302331 |
11 | 118a4069a02 |
12 | 5a3205730b |
13 | 2b06368b93 |
14 | 1668710391 |
15 | bbc5b343b |
hex | 708cb25fb |
30212302331 has 2 divisors, whose sum is σ = 30212302332. Its totient is φ = 30212302330.
The previous prime is 30212302313. The next prime is 30212302333. The reversal of 30212302331 is 13320321203.
Together with previous prime (30212302313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30212302331 is a prime.
It is a super-2 number, since 2×302123023312 (a number of 22 digits) contains 22 as substring.
Together with 30212302333, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (30212302333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15106151165 + 15106151166.
It is an arithmetic number, because the mean of its divisors is an integer number (15106151166).
Almost surely, 230212302331 is an apocalyptic number.
30212302331 is a deficient number, since it is larger than the sum of its proper divisors (1).
30212302331 is an equidigital number, since it uses as much as digits as its factorization.
30212302331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30212302331 its reverse (13320321203), we get a palindrome (43532623534).
The spelling of 30212302331 in words is "thirty billion, two hundred twelve million, three hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •