Base | Representation |
---|---|
bin | 110100110000… |
… | …001000000000 |
3 | 222000120021200 |
4 | 310300020000 |
5 | 12020003413 |
6 | 1212221200 |
7 | 225353433 |
oct | 64601000 |
9 | 28016250 |
10 | 13828608 |
11 | 7895702 |
12 | 476a800 |
13 | 2b32411 |
14 | 1b9d81a |
15 | 1332573 |
hex | d30200 |
13828608 has 60 divisors (see below), whose sum is σ = 39923598. Its totient is φ = 4608000.
The previous prime is 13828583. The next prime is 13828631. The reversal of 13828608 is 80682831.
It can be written as a sum of positive squares in only one way, i.e., 11614464 + 2214144 = 3408^2 + 1488^2 .
It is a super-3 number, since 3×138286083 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3108 + ... + 6108.
Almost surely, 213828608 is an apocalyptic number.
13828608 is a gapful number since it is divisible by the number (18) 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 13828608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19961799).
13828608 is an abundant number, since it is smaller than the sum of its proper divisors (26094990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13828608 is an equidigital number, since it uses as much as digits as its factorization.
13828608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3025 (or 3006 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
The square root of 13828608 is about 3718.6836380633. The cubic root of 13828608 is about 240.0266637043.
The spelling of 13828608 in words is "thirteen million, eight hundred twenty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •