Base | Representation |
---|---|
bin | 1001010000001010100110… |
… | …00010001000110100111001 |
3 | 2200001010021020112010122121 |
4 | 10220011103002020310321 |
5 | 10131324421201304041 |
6 | 111135042354121241 |
7 | 4166666014131325 |
oct | 450052302106471 |
9 | 80033236463577 |
10 | 20346653150521 |
11 | 6534a702a3885 |
12 | 2347398b80221 |
13 | b478b1678949 |
14 | 504ad73da985 |
15 | 2543e31807d1 |
hex | 128153088d39 |
20346653150521 has 2 divisors, whose sum is σ = 20346653150522. Its totient is φ = 20346653150520.
The previous prime is 20346653150513. The next prime is 20346653150557. The reversal of 20346653150521 is 12505135664302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13458185731600 + 6888467418921 = 3668540^2 + 2624589^2 .
It is a cyclic number.
It is not a de Polignac number, because 20346653150521 - 23 = 20346653150513 is a prime.
It is a super-2 number, since 2×203466531505212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20346653150591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10173326575260 + 10173326575261.
It is an arithmetic number, because the mean of its divisors is an integer number (10173326575261).
Almost surely, 220346653150521 is an apocalyptic number.
It is an amenable number.
20346653150521 is a deficient number, since it is larger than the sum of its proper divisors (1).
20346653150521 is an equidigital number, since it uses as much as digits as its factorization.
20346653150521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648000, while the sum is 43.
The spelling of 20346653150521 in words is "twenty trillion, three hundred forty-six billion, six hundred fifty-three million, one hundred fifty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •