Base | Representation |
---|---|
bin | 1011110101010011001111… |
… | …11011110001100110001111 |
3 | 10102010112212020011100202121 |
4 | 11322221213323301212033 |
5 | 11402310300313231223 |
6 | 131201420230233411 |
7 | 5323634050165213 |
oct | 572514773614617 |
9 | 112115766140677 |
10 | 26020655602063 |
11 | 8322330803aa1 |
12 | 2b02b88ab5867 |
13 | 1169977ab4275 |
14 | 65d599430943 |
15 | 301ccc3dc15d |
hex | 17aa67ef198f |
26020655602063 has 4 divisors (see below), whose sum is σ = 26025628023808. Its totient is φ = 26015683180320.
The previous prime is 26020655602031. The next prime is 26020655602069. The reversal of 26020655602063 is 36020655602062.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 26020655602063 - 25 = 26020655602031 is a prime.
It is a super-2 number, since 2×260206556020632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26020655602069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2486203023 + ... + 2486213488.
It is an arithmetic number, because the mean of its divisors is an integer number (6506407005952).
Almost surely, 226020655602063 is an apocalyptic number.
26020655602063 is a deficient number, since it is larger than the sum of its proper divisors (4972421745).
26020655602063 is an equidigital number, since it uses as much as digits as its factorization.
26020655602063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4972421744.
The product of its (nonzero) digits is 777600, while the sum is 43.
Subtracting 26020655602063 from its reverse (36020655602062), we obtain a palindrome (9999999999999).
The spelling of 26020655602063 in words is "twenty-six trillion, twenty billion, six hundred fifty-five million, six hundred two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •