Base | Representation |
---|---|
bin | 110011011111… |
… | …011000100000 |
3 | 221101202121210 |
4 | 303133120200 |
5 | 11423413023 |
6 | 1201150120 |
7 | 222505305 |
oct | 63373040 |
9 | 27352553 |
10 | 13497888 |
11 | 768a188 |
12 | 462b340 |
13 | 2a47a21 |
14 | 1b150ac |
15 | 12b9593 |
hex | cdf620 |
13497888 has 24 divisors (see below), whose sum is σ = 35432208. Its totient is φ = 4499264.
The previous prime is 13497877. The next prime is 13497899. The reversal of 13497888 is 88879431.
13497888 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13497877) and next prime (13497899).
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-3 number, since 3×134978883 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 70206 + ... + 70397.
It is an arithmetic number, because the mean of its divisors is an integer number (1476342).
Almost surely, 213497888 is an apocalyptic number.
It is an amenable number.
13497888 is an abundant number, since it is smaller than the sum of its proper divisors (21934320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13497888 is a wasteful number, since it uses less digits than its factorization.
13497888 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140616 (or 140608 counting only the distinct ones).
The product of its digits is 387072, while the sum is 48.
The square root of 13497888 is about 3673.9471961366. The cubic root of 13497888 is about 238.0977401439.
The spelling of 13497888 in words is "thirteen million, four hundred ninety-seven thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •