Base | Representation |
---|---|
bin | 11001011101011010… |
… | …00111010101010000 |
3 | 1022021120122202002110 |
4 | 30232231013111100 |
5 | 210443112332321 |
6 | 10140150545320 |
7 | 662501110620 |
oct | 145655072520 |
9 | 38246582073 |
10 | 13668480336 |
11 | 5884556645 |
12 | 2795668240 |
13 | 139aa264b4 |
14 | 93945a880 |
15 | 54ee9a176 |
hex | 32eb47550 |
13668480336 has 40 divisors (see below), whose sum is σ = 40354561984. Its totient is φ = 3905280000.
The previous prime is 13668480317. The next prime is 13668480337. The reversal of 13668480336 is 63308486631.
It is a happy number.
13668480336 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13668480337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20339665 + ... + 20340336.
Almost surely, 213668480336 is an apocalyptic number.
13668480336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
13668480336 is an abundant number, since it is smaller than the sum of its proper divisors (26686081648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13668480336 is a wasteful number, since it uses less digits than its factorization.
13668480336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40680019 (or 40680013 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 48.
The spelling of 13668480336 in words is "thirteen billion, six hundred sixty-eight million, four hundred eighty thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •