Base | Representation |
---|---|
bin | 10010101111011100… |
… | …000101001101010111 |
3 | 1220221102102200100022 |
4 | 102233130011031113 |
5 | 312203022241401 |
6 | 13124450535355 |
7 | 1311446513651 |
oct | 225734051527 |
9 | 56842380308 |
10 | 20123243351 |
11 | 8597056632 |
12 | 3a9729755b |
13 | 1b89098bb3 |
14 | d8c8076d1 |
15 | 7cb9b271b |
hex | 4af705357 |
20123243351 has 2 divisors, whose sum is σ = 20123243352. Its totient is φ = 20123243350.
The previous prime is 20123243303. The next prime is 20123243377. The reversal of 20123243351 is 15334232102.
It is a happy number.
It is an a-pointer prime, because the next prime (20123243377) can be obtained adding 20123243351 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20123243351 - 210 = 20123242327 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20123243351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20123243851) 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, 10061621675 + 10061621676.
It is an arithmetic number, because the mean of its divisors is an integer number (10061621676).
Almost surely, 220123243351 is an apocalyptic number.
20123243351 is a deficient number, since it is larger than the sum of its proper divisors (1).
20123243351 is an equidigital number, since it uses as much as digits as its factorization.
20123243351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 20123243351 its reverse (15334232102), we get a palindrome (35457475453).
The spelling of 20123243351 in words is "twenty billion, one hundred twenty-three million, two hundred forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •