Base | Representation |
---|---|
bin | 1011111010100001011010… |
… | …10010010100100000001001 |
3 | 10102202200221020201102121222 |
4 | 11331100231102110200021 |
5 | 11413230210413023024 |
6 | 131420050323211425 |
7 | 5342614626623003 |
oct | 575205522244011 |
9 | 112680836642558 |
10 | 26200060282889 |
11 | 8391423aa5059 |
12 | 2b318b7216b75 |
13 | 11808692ab63c |
14 | 668138141373 |
15 | 3067cc6ee85e |
hex | 17d42d494809 |
26200060282889 has 2 divisors, whose sum is σ = 26200060282890. Its totient is φ = 26200060282888.
The previous prime is 26200060282873. The next prime is 26200060282927. The reversal of 26200060282889 is 98828206000262.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23497209201664 + 2702851081225 = 4847392^2 + 1644035^2 .
It is a cyclic number.
It is not a de Polignac number, because 26200060282889 - 24 = 26200060282873 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 26200060282889.
It is not a weakly prime, because it can be changed into another prime (26200060282189) 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, 13100030141444 + 13100030141445.
It is an arithmetic number, because the mean of its divisors is an integer number (13100030141445).
Almost surely, 226200060282889 is an apocalyptic number.
It is an amenable number.
26200060282889 is a deficient number, since it is larger than the sum of its proper divisors (1).
26200060282889 is an equidigital number, since it uses as much as digits as its factorization.
26200060282889 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2654208, while the sum is 53.
The spelling of 26200060282889 in words is "twenty-six trillion, two hundred billion, sixty million, two hundred eighty-two thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •