Base | Representation |
---|---|
bin | 11000101001001110… |
… | …100010010101111111 |
3 | 2112022010221110220122 |
4 | 120221032202111333 |
5 | 413143114332234 |
6 | 20053425205155 |
7 | 1624511604641 |
oct | 305116422577 |
9 | 75263843818 |
10 | 26461480319 |
11 | 102498a78aa |
12 | 5165a907bb |
13 | 265925c981 |
14 | 13d0500891 |
15 | a4d15d92e |
hex | 6293a257f |
26461480319 has 8 divisors (see below), whose sum is σ = 27176582160. Its totient is φ = 25749697600.
The previous prime is 26461480303. The next prime is 26461480333. The reversal of 26461480319 is 91308416462.
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 26461480319 - 24 = 26461480303 is a prime.
It is a super-2 number, since 2×264614803192 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 26461480319.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26461480379) 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 7 ways as a sum of consecutive naturals, for example, 813617 + ... + 845514.
It is an arithmetic number, because the mean of its divisors is an integer number (3397072770).
Almost surely, 226461480319 is an apocalyptic number.
26461480319 is a deficient number, since it is larger than the sum of its proper divisors (715101841).
26461480319 is a wasteful number, since it uses less digits than its factorization.
26461480319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1659561.
The product of its (nonzero) digits is 248832, while the sum is 44.
The spelling of 26461480319 in words is "twenty-six billion, four hundred sixty-one million, four hundred eighty thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •