Base | Representation |
---|---|
bin | 1001001010010011110000… |
… | …10000001000000100001001 |
3 | 2122022212211112202202010222 |
4 | 10211021320100020010021 |
5 | 10120030302003031442 |
6 | 110502401523115425 |
7 | 4146313066412543 |
oct | 445117020100411 |
9 | 78285745682128 |
10 | 20145414111497 |
11 | 6467693092294 |
12 | 2314396512b75 |
13 | b31920746cac |
14 | 4d9086946693 |
15 | 24e06605d8d2 |
hex | 125278408109 |
20145414111497 has 2 divisors, whose sum is σ = 20145414111498. Its totient is φ = 20145414111496.
The previous prime is 20145414111467. The next prime is 20145414111569. The reversal of 20145414111497 is 79411141454102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16181157901561 + 3964256209936 = 4022581^2 + 1991044^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20145414111497 is a prime.
It is a super-3 number, since 3×201454141114973 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (20145414111467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10072707055748 + 10072707055749.
It is an arithmetic number, because the mean of its divisors is an integer number (10072707055749).
Almost surely, 220145414111497 is an apocalyptic number.
It is an amenable number.
20145414111497 is a deficient number, since it is larger than the sum of its proper divisors (1).
20145414111497 is an equidigital number, since it uses as much as digits as its factorization.
20145414111497 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 161280, while the sum is 44.
Adding to 20145414111497 its reverse (79411141454102), we get a palindrome (99556555565599).
The spelling of 20145414111497 in words is "twenty trillion, one hundred forty-five billion, four hundred fourteen million, one hundred eleven thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •