Base | Representation |
---|---|
bin | 10010101111011000… |
… | …110110101000110101 |
3 | 1220221100211200200202 |
4 | 102233120312220311 |
5 | 312202313202422 |
6 | 13124420450245 |
7 | 1311436361105 |
oct | 225730665065 |
9 | 56840750622 |
10 | 20122397237 |
11 | 8596628968 |
12 | 3a96b49985 |
13 | 1b88b60a37 |
14 | d8c667205 |
15 | 7cb896b92 |
hex | 4af636a35 |
20122397237 has 2 divisors, whose sum is σ = 20122397238. Its totient is φ = 20122397236.
The previous prime is 20122397227. The next prime is 20122397287. The reversal of 20122397237 is 73279322102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16203762436 + 3918634801 = 127294^2 + 62599^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122397237 - 212 = 20122393141 is a prime.
It is a super-3 number, since 3×201223972373 (a number of 32 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20122397237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20122397227) 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, 10061198618 + 10061198619.
It is an arithmetic number, because the mean of its divisors is an integer number (10061198619).
Almost surely, 220122397237 is an apocalyptic number.
It is an amenable number.
20122397237 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122397237 is an equidigital number, since it uses as much as digits as its factorization.
20122397237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63504, while the sum is 38.
The spelling of 20122397237 in words is "twenty billion, one hundred twenty-two million, three hundred ninety-seven thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •