Base | Representation |
---|---|
bin | 110101000111… |
… | …110110101000 |
3 | 222012111121101 |
4 | 311013312220 |
5 | 12031111200 |
6 | 1214251144 |
7 | 226240000 |
oct | 65076650 |
9 | 28174541 |
10 | 13925800 |
11 | 7951729 |
12 | 47b6ab4 |
13 | 2b67725 |
14 | 1bc7000 |
15 | 135126a |
hex | d47da8 |
13925800 has 120 divisors (see below), whose sum is σ = 39073950. Its totient is φ = 4609920.
The previous prime is 13925797. The next prime is 13925819. The reversal of 13925800 is 852931.
It can be written as a sum of positive squares in 3 ways, for example, as 10458756 + 3467044 = 3234^2 + 1862^2 .
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
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 29 ways as a sum of consecutive naturals, for example, 480186 + ... + 480214.
Almost surely, 213925800 is an apocalyptic number.
13925800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13925800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19536975).
13925800 is an abundant number, since it is smaller than the sum of its proper divisors (25148150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13925800 is an equidigital number, since it uses as much as digits as its factorization.
13925800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73 (or 43 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 13925800 is about 3731.7288218733. The cubic root of 13925800 is about 240.5876801626.
The spelling of 13925800 in words is "thirteen million, nine hundred twenty-five thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •