Base | Representation |
---|---|
bin | 1001001010010110010000… |
… | …01001110100101001011001 |
3 | 2122100000021222012110120121 |
4 | 10211023020021310221121 |
5 | 10120041023141331002 |
6 | 110503142531153241 |
7 | 4146361234605415 |
oct | 445131011645131 |
9 | 78300258173517 |
10 | 20146754636377 |
11 | 6468210849496 |
12 | 23146ab445821 |
13 | b31aa53a0695 |
14 | 4d91729b5d45 |
15 | 24e0e3aa6237 |
hex | 1252c8274a59 |
20146754636377 has 2 divisors, whose sum is σ = 20146754636378. Its totient is φ = 20146754636376.
The previous prime is 20146754636237. The next prime is 20146754636399. The reversal of 20146754636377 is 77363645764102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19912397953561 + 234356682816 = 4462331^2 + 484104^2 .
It is a cyclic number.
It is not a de Polignac number, because 20146754636377 - 227 = 20146620418649 is a prime.
It is a super-2 number, since 2×201467546363772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20146754636777) 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, 10073377318188 + 10073377318189.
It is an arithmetic number, because the mean of its divisors is an integer number (10073377318189).
Almost surely, 220146754636377 is an apocalyptic number.
It is an amenable number.
20146754636377 is a deficient number, since it is larger than the sum of its proper divisors (1).
20146754636377 is an equidigital number, since it uses as much as digits as its factorization.
20146754636377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 106686720, while the sum is 61.
The spelling of 20146754636377 in words is "twenty trillion, one hundred forty-six billion, seven hundred fifty-four million, six hundred thirty-six thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •