Base | Representation |
---|---|
bin | 1100000000011010011000… |
… | …10100100010010101101111 |
3 | 10110111001022202011212001000 |
4 | 12000031030110202111233 |
5 | 11430034201232423323 |
6 | 132053040541451343 |
7 | 5363341120456266 |
oct | 600151424422557 |
9 | 113431282155030 |
10 | 26402444420463 |
11 | 845a239624091 |
12 | 2b64b79270b53 |
13 | 11969805213b7 |
14 | 673c56b135dd |
15 | 30bbc5114e43 |
hex | 18034c52256f |
26402444420463 has 16 divisors (see below), whose sum is σ = 40463516354400. Its totient is φ = 16994676867840.
The previous prime is 26402444420413. The next prime is 26402444420477. The reversal of 26402444420463 is 36402444420462.
It is not a de Polignac number, because 26402444420463 - 213 = 26402444412271 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26402444420413) 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 in 15 ways as a sum of consecutive naturals, for example, 16859797698 + ... + 16859799263.
It is an arithmetic number, because the mean of its divisors is an integer number (2528969772150).
Almost surely, 226402444420463 is an apocalyptic number.
26402444420463 is a deficient number, since it is larger than the sum of its proper divisors (14061071933937).
26402444420463 is a wasteful number, since it uses less digits than its factorization.
26402444420463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33719596999 (or 33719596993 counting only the distinct ones).
The product of its (nonzero) digits is 3538944, while the sum is 45.
Subtracting 26402444420463 from its reverse (36402444420462), we obtain a palindrome (9999999999999).
The spelling of 26402444420463 in words is "twenty-six trillion, four hundred two billion, four hundred forty-four million, four hundred twenty thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •