Base | Representation |
---|---|
bin | 1001001001101010110011… |
… | …00011000000100100011001 |
3 | 2122020210002000202000022221 |
4 | 10210311121203000210121 |
5 | 10114200233034200403 |
6 | 110444323505344041 |
7 | 4144604131565344 |
oct | 444653143004431 |
9 | 78223060660287 |
10 | 20123424131353 |
11 | 645932933a784 |
12 | 231007a038021 |
13 | b2c8279c291a |
14 | 4d7d9c25345b |
15 | 24d6ca75ddbd |
hex | 124d598c0919 |
20123424131353 has 2 divisors, whose sum is σ = 20123424131354. Its totient is φ = 20123424131352.
The previous prime is 20123424131341. The next prime is 20123424131443. The reversal of 20123424131353 is 35313142432102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17676912089664 + 2446512041689 = 4204392^2 + 1564133^2 .
It is a cyclic number.
It is not a de Polignac number, because 20123424131353 - 29 = 20123424130841 is a prime.
It is a super-2 number, since 2×201234241313532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20123424131323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10061712065676 + 10061712065677.
It is an arithmetic number, because the mean of its divisors is an integer number (10061712065677).
Almost surely, 220123424131353 is an apocalyptic number.
It is an amenable number.
20123424131353 is a deficient number, since it is larger than the sum of its proper divisors (1).
20123424131353 is an equidigital number, since it uses as much as digits as its factorization.
20123424131353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 20123424131353 its reverse (35313142432102), we get a palindrome (55436566563455).
The spelling of 20123424131353 in words is "twenty trillion, one hundred twenty-three billion, four hundred twenty-four million, one hundred thirty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •