Base | Representation |
---|---|
bin | 11000100111010001… |
… | …11101000111111001 |
3 | 1021002221020022222121 |
4 | 30103220331013321 |
5 | 204030341430423 |
6 | 10023130321241 |
7 | 645315406300 |
oct | 142350750771 |
9 | 37087208877 |
10 | 13214405113 |
11 | 5671207168 |
12 | 2689589221 |
13 | 1327930930 |
14 | 8d501b437 |
15 | 5251a445d |
hex | 313a3d1f9 |
13214405113 has 24 divisors (see below), whose sum is σ = 16613032128. Its totient is φ = 10418266656.
The previous prime is 13214405107. The next prime is 13214405117. The reversal of 13214405113 is 31150441231.
It is not a de Polignac number, because 13214405113 - 25 = 13214405081 is a prime.
It is a super-3 number, since 3×132144051133 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (13214405117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 143620 + ... + 216922.
It is an arithmetic number, because the mean of its divisors is an integer number (692209672).
Almost surely, 213214405113 is an apocalyptic number.
13214405113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13214405113 is a deficient number, since it is larger than the sum of its proper divisors (3398627015).
13214405113 is a wasteful number, since it uses less digits than its factorization.
13214405113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73613 (or 73606 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 13214405113 its reverse (31150441231), we get a palindrome (44364846344).
The spelling of 13214405113 in words is "thirteen billion, two hundred fourteen million, four hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •