Base | Representation |
---|---|
bin | 11100010101010011… |
… | …101110000110110101 |
3 | 2220112011212001012202 |
4 | 130111103232012311 |
5 | 444301044342242 |
6 | 21550434354245 |
7 | 2124614650655 |
oct | 342523560665 |
9 | 86464761182 |
10 | 30422262197 |
11 | 119a1634958 |
12 | 5a9042b985 |
13 | 2b3a9cc6a2 |
14 | 1688566365 |
15 | bd0c38932 |
hex | 7154ee1b5 |
30422262197 has 2 divisors, whose sum is σ = 30422262198. Its totient is φ = 30422262196.
The previous prime is 30422262181. The next prime is 30422262203. The reversal of 30422262197 is 79126222403.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28940474161 + 1481788036 = 170119^2 + 38494^2 .
It is an emirp because it is prime and its reverse (79126222403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30422262197 - 24 = 30422262181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30422262197.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30422262797) 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, 15211131098 + 15211131099.
It is an arithmetic number, because the mean of its divisors is an integer number (15211131099).
Almost surely, 230422262197 is an apocalyptic number.
It is an amenable number.
30422262197 is a deficient number, since it is larger than the sum of its proper divisors (1).
30422262197 is an equidigital number, since it uses as much as digits as its factorization.
30422262197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 38.
The spelling of 30422262197 in words is "thirty billion, four hundred twenty-two million, two hundred sixty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •