Base | Representation |
---|---|
bin | 110011001000… |
… | …000100000000 |
3 | 221012220121000 |
4 | 303020010000 |
5 | 11412333433 |
6 | 1155132000 |
7 | 221626650 |
oct | 63100400 |
9 | 27186530 |
10 | 13402368 |
11 | 7624441 |
12 | 45a4000 |
13 | 2a133c5 |
14 | 1acc360 |
15 | 129b113 |
hex | cc8100 |
13402368 has 144 divisors (see below), whose sum is σ = 45458560. Its totient is φ = 3815424.
The previous prime is 13402339. The next prime is 13402373. The reversal of 13402368 is 86320431.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 16.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48246 + ... + 48522.
Almost surely, 213402368 is an apocalyptic number.
13402368 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 13402368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22729280).
13402368 is an abundant number, since it is smaller than the sum of its proper divisors (32056192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13402368 is an equidigital number, since it uses as much as digits as its factorization.
13402368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 309 (or 289 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 13402368 is about 3660.9244734083. The cubic root of 13402368 is about 237.5347642555.
Adding to 13402368 its reverse (86320431), we get a palindrome (99722799).
The spelling of 13402368 in words is "thirteen million, four hundred two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •