Base | Representation |
---|---|
bin | 110010110010… |
… | …101111111100 |
3 | 221001110211200 |
4 | 302302233330 |
5 | 11402040233 |
6 | 1153215500 |
7 | 221114304 |
oct | 62625774 |
9 | 27043750 |
10 | 13315068 |
11 | 7574898 |
12 | 4561590 |
13 | 29b2750 |
14 | 1aa8604 |
15 | 1280313 |
hex | cb2bfc |
13315068 has 72 divisors (see below), whose sum is σ = 37853088. Its totient is φ = 3915648.
The previous prime is 13315051. The next prime is 13315069. The reversal of 13315068 is 86051331.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13315069) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10146 + ... + 11382.
Almost surely, 213315068 is an apocalyptic number.
13315068 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 13315068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18926544).
13315068 is an abundant number, since it is smaller than the sum of its proper divisors (24538020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13315068 is a wasteful number, since it uses less digits than its factorization.
13315068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283 (or 1278 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 13315068 is about 3648.9817757835. The cubic root of 13315068 is about 237.0178910811.
Adding to 13315068 its reverse (86051331), we get a palindrome (99366399).
The spelling of 13315068 in words is "thirteen million, three hundred fifteen thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •