Base | Representation |
---|---|
bin | 1001000110110001101010… |
… | …00000000111000101100111 |
3 | 2121220021111212001010220112 |
4 | 10203120311000013011213 |
5 | 10111033201322133211 |
6 | 110330524430523235 |
7 | 4134455023045346 |
oct | 443306500070547 |
9 | 77807455033815 |
10 | 20024026755431 |
11 | 6420162095006 |
12 | 22b495a06651b |
13 | b23346cba29a |
14 | 4d324d25db5d |
15 | 24ad0e3ae88b |
hex | 123635007167 |
20024026755431 has 2 divisors, whose sum is σ = 20024026755432. Its totient is φ = 20024026755430.
The previous prime is 20024026755331. The next prime is 20024026755451. The reversal of 20024026755431 is 13455762042002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20024026755431 - 218 = 20024026493287 is a prime.
It is a super-2 number, since 2×200240267554312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20024026755451) 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, 10012013377715 + 10012013377716.
It is an arithmetic number, because the mean of its divisors is an integer number (10012013377716).
Almost surely, 220024026755431 is an apocalyptic number.
20024026755431 is a deficient number, since it is larger than the sum of its proper divisors (1).
20024026755431 is an equidigital number, since it uses as much as digits as its factorization.
20024026755431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 403200, while the sum is 41.
Adding to 20024026755431 its reverse (13455762042002), we get a palindrome (33479788797433).
The spelling of 20024026755431 in words is "twenty trillion, twenty-four billion, twenty-six million, seven hundred fifty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •