Base | Representation |
---|---|
bin | 110100101111… |
… | …011010100100 |
3 | 222000102021222 |
4 | 310233122210 |
5 | 12014410300 |
6 | 1212155512 |
7 | 225342110 |
oct | 64573244 |
9 | 28012258 |
10 | 13825700 |
11 | 78934a9 |
12 | 4768b98 |
13 | 2b30cb5 |
14 | 1b9c740 |
15 | 1331785 |
hex | d2f6a4 |
13825700 has 36 divisors (see below), whose sum is σ = 34289472. Its totient is φ = 4740000.
The previous prime is 13825697. The next prime is 13825703. The reversal of 13825700 is 752831.
It is an interprime number because it is at equal distance from previous prime (13825697) and next prime (13825703).
It is a super-2 number, since 2×138257002 = 382299960980000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13825700.
It is not an unprimeable number, because it can be changed into a prime (13825703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9176 + ... + 10575.
Almost surely, 213825700 is an apocalyptic number.
13825700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13825700 is an abundant number, since it is smaller than the sum of its proper divisors (20463772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13825700 is a wasteful number, since it uses less digits than its factorization.
13825700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19772 (or 19765 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 13825700 is about 3718.2926189314. The cubic root of 13825700 is about 240.0098375597.
The spelling of 13825700 in words is "thirteen million, eight hundred twenty-five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •