Base | Representation |
---|---|
bin | 1001001111001111110101… |
… | …11111111100011000010001 |
3 | 2122221002212001011122201221 |
4 | 10213213322333330120101 |
5 | 10130320322010043134 |
6 | 111112344445125041 |
7 | 4164501253554613 |
oct | 447477277743021 |
9 | 78832761148657 |
10 | 20315111409169 |
11 | 652265485a745 |
12 | 2341255859781 |
13 | b44925a68275 |
14 | 503384304db3 |
15 | 2536990145b4 |
hex | 1279faffc611 |
20315111409169 has 2 divisors, whose sum is σ = 20315111409170. Its totient is φ = 20315111409168.
The previous prime is 20315111409139. The next prime is 20315111409199. The reversal of 20315111409169 is 96190411151302.
It is a balanced prime because it is at equal distance from previous prime (20315111409139) and next prime (20315111409199).
It can be written as a sum of positive squares in only one way, i.e., 14824525169169 + 5490586240000 = 3850263^2 + 2343200^2 .
It is a cyclic number.
It is not a de Polignac number, because 20315111409169 - 235 = 20280751670801 is a prime.
It is a super-2 number, since 2×203151114091692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20315111409139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10157555704584 + 10157555704585.
It is an arithmetic number, because the mean of its divisors is an integer number (10157555704585).
Almost surely, 220315111409169 is an apocalyptic number.
It is an amenable number.
20315111409169 is a deficient number, since it is larger than the sum of its proper divisors (1).
20315111409169 is an equidigital number, since it uses as much as digits as its factorization.
20315111409169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 43.
The spelling of 20315111409169 in words is "twenty trillion, three hundred fifteen billion, one hundred eleven million, four hundred nine thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •