Base | Representation |
---|---|
bin | 1001001011111010110110… |
… | …11000101001100100101001 |
3 | 2122112011201000001210102101 |
4 | 10211331123120221210221 |
5 | 10121432131140201411 |
6 | 110544034131333401 |
7 | 4153312526063215 |
oct | 445753330514451 |
9 | 78464630053371 |
10 | 20200764381481 |
11 | 6489106951372 |
12 | 2323063151261 |
13 | b36c01a94638 |
14 | 4dba17a75945 |
15 | 2507054988c1 |
hex | 125f5b629929 |
20200764381481 has 2 divisors, whose sum is σ = 20200764381482. Its totient is φ = 20200764381480.
The previous prime is 20200764381449. The next prime is 20200764381547. The reversal of 20200764381481 is 18418346700202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19324464321600 + 876300059881 = 4395960^2 + 936109^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200764381481 - 25 = 20200764381449 is a prime.
It is a super-2 number, since 2×202007643814812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20200764381401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100382190740 + 10100382190741.
It is an arithmetic number, because the mean of its divisors is an integer number (10100382190741).
Almost surely, 220200764381481 is an apocalyptic number.
It is an amenable number.
20200764381481 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200764381481 is an equidigital number, since it uses as much as digits as its factorization.
20200764381481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 516096, while the sum is 46.
The spelling of 20200764381481 in words is "twenty trillion, two hundred billion, seven hundred sixty-four million, three hundred eighty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •