Base | Representation |
---|---|
bin | 1001001001011110011000… |
… | …00100000110110000111001 |
3 | 2122020010212021111012021121 |
4 | 10210233030010012300321 |
5 | 10114043103400204023 |
6 | 110441302045105241 |
7 | 4144246645133134 |
oct | 444571404066071 |
9 | 78203767435247 |
10 | 20116755475513 |
11 | 6456517028964 |
12 | 230a918858221 |
13 | b2c004240518 |
14 | 4d792870921b |
15 | 24d43a095d5d |
hex | 124bcc106c39 |
20116755475513 has 2 divisors, whose sum is σ = 20116755475514. Its totient is φ = 20116755475512.
The previous prime is 20116755475501. The next prime is 20116755475543. The reversal of 20116755475513 is 31557455761102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20108740212729 + 8015262784 = 4484277^2 + 89528^2 .
It is a cyclic number.
It is not a de Polignac number, because 20116755475513 - 237 = 19979316522041 is a prime.
It is a super-2 number, since 2×201167554755132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20116755475543) 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, 10058377737756 + 10058377737757.
It is an arithmetic number, because the mean of its divisors is an integer number (10058377737757).
Almost surely, 220116755475513 is an apocalyptic number.
It is an amenable number.
20116755475513 is a deficient number, since it is larger than the sum of its proper divisors (1).
20116755475513 is an equidigital number, since it uses as much as digits as its factorization.
20116755475513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4410000, while the sum is 52.
The spelling of 20116755475513 in words is "twenty trillion, one hundred sixteen billion, seven hundred fifty-five million, four hundred seventy-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •