Base | Representation |
---|---|
bin | 1011111010110101001000… |
… | …00000111010110010010001 |
3 | 10102210201020201100200200201 |
4 | 11331122210000322302101 |
5 | 11413413343342110101 |
6 | 131425000333215201 |
7 | 5343441101150131 |
oct | 575324400726221 |
9 | 112721221320621 |
10 | 26210642144401 |
11 | 83959641a9250 |
12 | 2b3396b031501 |
13 | 11818646b3660 |
14 | 66885d688ac1 |
15 | 306beb6e5e01 |
hex | 17d6a403ac91 |
26210642144401 has 16 divisors (see below), whose sum is σ = 31314836185920. Its totient is φ = 21622148781120.
The previous prime is 26210642144389. The next prime is 26210642144413. The reversal of 26210642144401 is 10444124601262.
It is an interprime number because it is at equal distance from previous prime (26210642144389) and next prime (26210642144413).
It is a cyclic number.
It is not a de Polignac number, because 26210642144401 - 219 = 26210641620113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26210642144431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1553306850 + ... + 1553323723.
It is an arithmetic number, because the mean of its divisors is an integer number (1957177261620).
Almost surely, 226210642144401 is an apocalyptic number.
It is an amenable number.
26210642144401 is a deficient number, since it is larger than the sum of its proper divisors (5104194041519).
26210642144401 is a wasteful number, since it uses less digits than its factorization.
26210642144401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3106630656.
The product of its (nonzero) digits is 73728, while the sum is 37.
Adding to 26210642144401 its reverse (10444124601262), we get a palindrome (36654766745663).
The spelling of 26210642144401 in words is "twenty-six trillion, two hundred ten billion, six hundred forty-two million, one hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •