Base | Representation |
---|---|
bin | 11000001111100001… |
… | …110101001011101000 |
3 | 2111012002122210200112 |
4 | 120033201311023220 |
5 | 411302231034400 |
6 | 15542544153452 |
7 | 1611025105451 |
oct | 301741651350 |
9 | 74162583615 |
10 | 26030330600 |
11 | 1004849671a |
12 | 5065608888 |
13 | 25bab32cb1 |
14 | 138d14c128 |
15 | a25395835 |
hex | 60f8752e8 |
26030330600 has 48 divisors (see below), whose sum is σ = 63705818400. Its totient is φ = 9864123840.
The previous prime is 26030330597. The next prime is 26030330609. The reversal of 26030330600 is 603303062.
It is a happy number.
It is a super-2 number, since 2×260303306002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (26030330609) 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 11 ways as a sum of consecutive naturals, for example, 3421244 + ... + 3428843.
It is an arithmetic number, because the mean of its divisors is an integer number (1327204550).
Almost surely, 226030330600 is an apocalyptic number.
26030330600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26030330600 is an abundant number, since it is smaller than the sum of its proper divisors (37675487800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26030330600 is a wasteful number, since it uses less digits than its factorization.
26030330600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6850122 (or 6850113 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 26030330600 its reverse (603303062), we get a palindrome (26633633662).
The spelling of 26030330600 in words is "twenty-six billion, thirty million, three hundred thirty thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •