Base | Representation |
---|---|
bin | 1001001101111110011101… |
… | …01000111100101001001001 |
3 | 2122202221001221101121211122 |
4 | 10212333032220330221021 |
5 | 10124111330340313343 |
6 | 111040321033205025 |
7 | 4161363423551063 |
oct | 446771650745111 |
9 | 78687057347748 |
10 | 20271417510473 |
11 | 6506072789968 |
12 | 23348a0860775 |
13 | b4078161a23c |
14 | 5011db304733 |
15 | 25248d0be068 |
hex | 126fcea3ca49 |
20271417510473 has 2 divisors, whose sum is σ = 20271417510474. Its totient is φ = 20271417510472.
The previous prime is 20271417510469. The next prime is 20271417510503. The reversal of 20271417510473 is 37401571417202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12112327996729 + 8159089513744 = 3480277^2 + 2856412^2 .
It is a cyclic number.
It is not a de Polignac number, because 20271417510473 - 22 = 20271417510469 is a prime.
It is a super-2 number, since 2×202714175104732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20271417510433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10135708755236 + 10135708755237.
It is an arithmetic number, because the mean of its divisors is an integer number (10135708755237).
Almost surely, 220271417510473 is an apocalyptic number.
It is an amenable number.
20271417510473 is a deficient number, since it is larger than the sum of its proper divisors (1).
20271417510473 is an equidigital number, since it uses as much as digits as its factorization.
20271417510473 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 329280, while the sum is 44.
Adding to 20271417510473 its reverse (37401571417202), we get a palindrome (57672988927675).
The spelling of 20271417510473 in words is "twenty trillion, two hundred seventy-one billion, four hundred seventeen million, five hundred ten thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.270 sec. • engine limits •