Base | Representation |
---|---|
bin | 1001010010011000110101… |
… | …00001010110000011000001 |
3 | 2200022102100222202121202221 |
4 | 10221030122201112003001 |
5 | 10134102313144104103 |
6 | 111234111525411041 |
7 | 4205341223316652 |
oct | 451143241260301 |
9 | 80272328677687 |
10 | 20423014441153 |
11 | 6564396252735 |
12 | 235a14a269a81 |
13 | b51b6099939c |
14 | 50869cbcb529 |
15 | 2563b1e931bd |
hex | 12931a8560c1 |
20423014441153 has 2 divisors, whose sum is σ = 20423014441154. Its totient is φ = 20423014441152.
The previous prime is 20423014441129. The next prime is 20423014441171. The reversal of 20423014441153 is 35114441032402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13537601705104 + 6885412736049 = 3679348^2 + 2624007^2 .
It is a cyclic number.
It is not a de Polignac number, because 20423014441153 - 25 = 20423014441121 is a prime.
It is not a weakly prime, because it can be changed into another prime (20423014441183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10211507220576 + 10211507220577.
It is an arithmetic number, because the mean of its divisors is an integer number (10211507220577).
Almost surely, 220423014441153 is an apocalyptic number.
It is an amenable number.
20423014441153 is a deficient number, since it is larger than the sum of its proper divisors (1).
20423014441153 is an equidigital number, since it uses as much as digits as its factorization.
20423014441153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 20423014441153 its reverse (35114441032402), we get a palindrome (55537455473555).
The spelling of 20423014441153 in words is "twenty trillion, four hundred twenty-three billion, fourteen million, four hundred forty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •