Base | Representation |
---|---|
bin | 10100011000000111… |
… | …01011111110101000 |
3 | 1001020101222220211022 |
4 | 22030003223332220 |
5 | 134401031231100 |
6 | 5005311552012 |
7 | 535045004222 |
oct | 121403537650 |
9 | 31211886738 |
10 | 10939711400 |
11 | 4704200102 |
12 | 215382b608 |
13 | 10545a9217 |
14 | 75ac99412 |
15 | 440630e85 |
hex | 28c0ebfa8 |
10939711400 has 24 divisors (see below), whose sum is σ = 25434829470. Its totient is φ = 4375884480.
The previous prime is 10939711381. The next prime is 10939711403. The reversal of 10939711400 is 411793901.
It is a happy number.
10939711400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 7659400324 + 3280311076 = 87518^2 + 57274^2 .
It is not an unprimeable number, because it can be changed into a prime (10939711403) 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 5 ways as a sum of consecutive naturals, for example, 27349079 + ... + 27349478.
Almost surely, 210939711400 is an apocalyptic number.
10939711400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10939711400 is an abundant number, since it is smaller than the sum of its proper divisors (14495118070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10939711400 is a wasteful number, since it uses less digits than its factorization.
10939711400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54698573 (or 54698564 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 35.
The spelling of 10939711400 in words is "ten billion, nine hundred thirty-nine million, seven hundred eleven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •