Base | Representation |
---|---|
bin | 1001011010111001101110… |
… | …00010000110010001001001 |
3 | 2201100101110100002110220011 |
4 | 10231130313002012101021 |
5 | 10203400421421043244 |
6 | 112020331554031521 |
7 | 4235435440332625 |
oct | 455346702062111 |
9 | 81311410073804 |
10 | 20715550565449 |
11 | 6667463271713 |
12 | 23a698bb785a1 |
13 | b7361137769c |
14 | 5188d0942185 |
15 | 25dcd4258434 |
hex | 12d737086449 |
20715550565449 has 2 divisors, whose sum is σ = 20715550565450. Its totient is φ = 20715550565448.
The previous prime is 20715550565429. The next prime is 20715550565497. The reversal of 20715550565449 is 94456505551702.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19722125721600 + 993424843849 = 4440960^2 + 996707^2 .
It is a cyclic number.
It is not a de Polignac number, because 20715550565449 - 217 = 20715550434377 is a prime.
It is a super-3 number, since 3×207155505654493 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20715550565393 and 20715550565402.
It is not a weakly prime, because it can be changed into another prime (20715550565429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10357775282724 + 10357775282725.
It is an arithmetic number, because the mean of its divisors is an integer number (10357775282725).
Almost surely, 220715550565449 is an apocalyptic number.
It is an amenable number.
20715550565449 is a deficient number, since it is larger than the sum of its proper divisors (1).
20715550565449 is an equidigital number, since it uses as much as digits as its factorization.
20715550565449 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 37800000, while the sum is 58.
The spelling of 20715550565449 in words is "twenty trillion, seven hundred fifteen billion, five hundred fifty million, five hundred sixty-five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •