Base | Representation |
---|---|
bin | 11000100111110110… |
… | …101111101111001011 |
3 | 2112020112122020220020 |
4 | 120213312233233023 |
5 | 413121221412012 |
6 | 20051244031523 |
7 | 1624112154165 |
oct | 304766575713 |
9 | 75215566806 |
10 | 26438466507 |
11 | 10237909222 |
12 | 515a2325a3 |
13 | 265456282b |
14 | 13cb42d935 |
15 | a4b114a8c |
hex | 627dafbcb |
26438466507 has 16 divisors (see below), whose sum is σ = 35829319680. Its totient is φ = 17338276800.
The previous prime is 26438466497. The next prime is 26438466559. The reversal of 26438466507 is 70566483462.
It is a happy number.
It is not a de Polignac number, because 26438466507 - 24 = 26438466491 is a prime.
It is a super-2 number, since 2×264384665072 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 26438466507.
It is not an unprimeable number, because it can be changed into a prime (26438466007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 141594 + ... + 270047.
It is an arithmetic number, because the mean of its divisors is an integer number (2239332480).
Almost surely, 226438466507 is an apocalyptic number.
26438466507 is a deficient number, since it is larger than the sum of its proper divisors (9390853173).
26438466507 is a wasteful number, since it uses less digits than its factorization.
26438466507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411994.
The product of its (nonzero) digits is 5806080, while the sum is 51.
It can be divided in two parts, 264384 and 66507, that added together give a triangular number (330891 = T813).
The spelling of 26438466507 in words is "twenty-six billion, four hundred thirty-eight million, four hundred sixty-six thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •