Base | Representation |
---|---|
bin | 11000101010010001… |
… | …010111101100101001 |
3 | 2112100100220120220002 |
4 | 120222101113230221 |
5 | 413212111002421 |
6 | 20055252512345 |
7 | 1625113534532 |
oct | 305221275451 |
9 | 75310816802 |
10 | 26479000361 |
11 | 10258783980 |
12 | 516b91b6b5 |
13 | 265ca85368 |
14 | 13d2981689 |
15 | a4e96eb0b |
hex | 62a457b29 |
26479000361 has 4 divisors (see below), whose sum is σ = 28886182224. Its totient is φ = 24071818500.
The previous prime is 26479000307. The next prime is 26479000397. The reversal of 26479000361 is 16300097462.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 26479000361 - 226 = 26411891497 is a prime.
It is a super-2 number, since 2×264790003612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (26479000061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1203590915 + ... + 1203590936.
It is an arithmetic number, because the mean of its divisors is an integer number (7221545556).
Almost surely, 226479000361 is an apocalyptic number.
It is an amenable number.
26479000361 is a deficient number, since it is larger than the sum of its proper divisors (2407181863).
26479000361 is a wasteful number, since it uses less digits than its factorization.
26479000361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2407181862.
The product of its (nonzero) digits is 54432, while the sum is 38.
The spelling of 26479000361 in words is "twenty-six billion, four hundred seventy-nine million, three hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •