Base | Representation |
---|---|
bin | 11000110011100001… |
… | …10010010011001101 |
3 | 1021101002111212000012 |
4 | 30121300302103031 |
5 | 204233140334404 |
6 | 10041240043005 |
7 | 651003443216 |
oct | 143160622315 |
9 | 37332455005 |
10 | 13317121229 |
11 | 5714193315 |
12 | 26b7a63465 |
13 | 1342cb57b9 |
14 | 90491840d |
15 | 52e1e3a6e |
hex | 319c324cd |
13317121229 has 4 divisors (see below), whose sum is σ = 13317359676. Its totient is φ = 13316882784.
The previous prime is 13317121219. The next prime is 13317121231. The reversal of 13317121229 is 92212171331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 92212171331 = 7 ⋅13173167333.
It can be written as a sum of positive squares in 2 ways, for example, as 9886324900 + 3430796329 = 99430^2 + 58573^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13317121229 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13317121195 and 13317121204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13317121219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14687 + ... + 163859.
It is an arithmetic number, because the mean of its divisors is an integer number (3329339919).
Almost surely, 213317121229 is an apocalyptic number.
It is an amenable number.
13317121229 is a deficient number, since it is larger than the sum of its proper divisors (238447).
13317121229 is an equidigital number, since it uses as much as digits as its factorization.
13317121229 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238446.
The product of its digits is 4536, while the sum is 32.
The spelling of 13317121229 in words is "thirteen billion, three hundred seventeen million, one hundred twenty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •