Base | Representation |
---|---|
bin | 110011010011… |
… | …011001010110 |
3 | 221022021021100 |
4 | 303103121112 |
5 | 11420330130 |
6 | 1200130530 |
7 | 222212205 |
oct | 63233126 |
9 | 27267240 |
10 | 13448790 |
11 | 7656303 |
12 | 4606a46 |
13 | 2a2b584 |
14 | 1b0123c |
15 | 12a9c60 |
hex | cd3656 |
13448790 has 96 divisors (see below), whose sum is σ = 37402560. Its totient is φ = 3345408.
The previous prime is 13448783. The next prime is 13448791. The reversal of 13448790 is 9784431.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13448791) 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 47 ways as a sum of consecutive naturals, for example, 151066 + ... + 151154.
It is an arithmetic number, because the mean of its divisors is an integer number (389610).
Almost surely, 213448790 is an apocalyptic number.
13448790 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13448790, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18701280).
13448790 is an abundant number, since it is smaller than the sum of its proper divisors (23953770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13448790 is a wasteful number, since it uses less digits than its factorization.
13448790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198 (or 195 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 13448790 is about 3667.2591945484. The cubic root of 13448790 is about 237.8086992295.
The spelling of 13448790 in words is "thirteen million, four hundred forty-eight thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •