Base | Representation |
---|---|
bin | 1001001111100101101010… |
… | …01100000100010100001001 |
3 | 2122222020002101112000000202 |
4 | 10213302311030010110021 |
5 | 10131013314210143134 |
6 | 111122003045541545 |
7 | 4165364450265602 |
oct | 447626514042411 |
9 | 78866071460022 |
10 | 20326825084169 |
11 | 652761592808a |
12 | 23435847148b5 |
13 | b45a717ac4c6 |
14 | 503b75cacda9 |
15 | 253b32577d7e |
hex | 127cb5304509 |
20326825084169 has 2 divisors, whose sum is σ = 20326825084170. Its totient is φ = 20326825084168.
The previous prime is 20326825084141. The next prime is 20326825084339. The reversal of 20326825084169 is 96148052862302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19487103936400 + 839721147769 = 4414420^2 + 916363^2 .
It is a cyclic number.
It is not a de Polignac number, because 20326825084169 - 28 = 20326825083913 is a prime.
It is a super-2 number, since 2×203268250841692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20326825089169) 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, 10163412542084 + 10163412542085.
It is an arithmetic number, because the mean of its divisors is an integer number (10163412542085).
Almost surely, 220326825084169 is an apocalyptic number.
It is an amenable number.
20326825084169 is a deficient number, since it is larger than the sum of its proper divisors (1).
20326825084169 is an equidigital number, since it uses as much as digits as its factorization.
20326825084169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9953280, while the sum is 56.
The spelling of 20326825084169 in words is "twenty trillion, three hundred twenty-six billion, eight hundred twenty-five million, eighty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •