Base | Representation |
---|---|
bin | 10010101110110000… |
… | …000011011111010001 |
3 | 1220220121201022112201 |
4 | 102232300003133101 |
5 | 312142043430334 |
6 | 13123355323201 |
7 | 1311246434422 |
oct | 225660033721 |
9 | 56817638481 |
10 | 20111701969 |
11 | 85905933a7 |
12 | 3a93450501 |
13 | 1b86887888 |
14 | d8b081649 |
15 | 7ca982c14 |
hex | 4aec037d1 |
20111701969 has 2 divisors, whose sum is σ = 20111701970. Its totient is φ = 20111701968.
The previous prime is 20111701963. The next prime is 20111702071. The reversal of 20111701969 is 96910711102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20068405569 + 43296400 = 141663^2 + 6580^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111701969 - 25 = 20111701937 is a prime.
It is a super-2 number, since 2×201117019692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20111701963) 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, 10055850984 + 10055850985.
It is an arithmetic number, because the mean of its divisors is an integer number (10055850985).
Almost surely, 220111701969 is an apocalyptic number.
It is an amenable number.
20111701969 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111701969 is an equidigital number, since it uses as much as digits as its factorization.
20111701969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 37.
The spelling of 20111701969 in words is "twenty billion, one hundred eleven million, seven hundred one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •