Base | Representation |
---|---|
bin | 11000101010010011… |
… | …011011111000110110 |
3 | 2112100101221002121220 |
4 | 120222103123320312 |
5 | 413212230314224 |
6 | 20055312251210 |
7 | 1625121251235 |
oct | 305223337066 |
9 | 75311832556 |
10 | 26479541814 |
11 | 10259013760 |
12 | 516bb40b06 |
13 | 265cc1494b |
14 | 13d2a82b1c |
15 | a4ea2a279 |
hex | 62a4dbe36 |
26479541814 has 128 divisors (see below), whose sum is σ = 60449697792. Its totient is φ = 7662695040.
The previous prime is 26479541813. The next prime is 26479541827. The reversal of 26479541814 is 41814597462.
It is a super-2 number, since 2×264795418142 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26479541813) 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 63 ways as a sum of consecutive naturals, for example, 29852479 + ... + 29853365.
It is an arithmetic number, because the mean of its divisors is an integer number (472263264).
Almost surely, 226479541814 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26479541814, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30224848896).
26479541814 is an abundant number, since it is smaller than the sum of its proper divisors (33970155978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26479541814 is a wasteful number, since it uses less digits than its factorization.
26479541814 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1170.
The product of its digits is 1935360, while the sum is 51.
The spelling of 26479541814 in words is "twenty-six billion, four hundred seventy-nine million, five hundred forty-one thousand, eight hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •