Base | Representation |
---|---|
bin | 11000100111011011… |
… | …001011100100111001 |
3 | 2112020001001010200112 |
4 | 120213123023210321 |
5 | 413112344144010 |
6 | 20050425114105 |
7 | 1623663560135 |
oct | 304733134471 |
9 | 75201033615 |
10 | 26431240505 |
11 | 1023382321a |
12 | 5157928935 |
13 | 2652c027a7 |
14 | 13ca4ac3c5 |
15 | a4a688a05 |
hex | 6276cb939 |
26431240505 has 8 divisors (see below), whose sum is σ = 32008475400. Its totient is φ = 20951001216.
The previous prime is 26431240483. The next prime is 26431240567. The reversal of 26431240505 is 50504213462.
It can be written as a sum of positive squares in 4 ways, for example, as 919484329 + 25511756176 = 30323^2 + 159724^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26431240505 - 220 = 26430191929 is a prime.
It is a super-2 number, since 2×264312405052 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 24248300 + ... + 24249389.
It is an arithmetic number, because the mean of its divisors is an integer number (4001059425).
Almost surely, 226431240505 is an apocalyptic number.
It is an amenable number.
26431240505 is a deficient number, since it is larger than the sum of its proper divisors (5577234895).
26431240505 is a wasteful number, since it uses less digits than its factorization.
26431240505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48497803.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 26431240505 its reverse (50504213462), we get a palindrome (76935453967).
The spelling of 26431240505 in words is "twenty-six billion, four hundred thirty-one million, two hundred forty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •