Base | Representation |
---|---|
bin | 11000001111010011… |
… | …11000001000011101 |
3 | 1020120220212011101000 |
4 | 30013221320020131 |
5 | 203122402221341 |
6 | 5551144340513 |
7 | 640324253046 |
oct | 140751701035 |
9 | 36526764330 |
10 | 13013320221 |
11 | 5578753100 |
12 | 2632174739 |
13 | 12c50868a5 |
14 | 8b64358cd |
15 | 5126d38b6 |
hex | 307a7821d |
13013320221 has 24 divisors (see below), whose sum is σ = 21190964480. Its totient is φ = 7886858760.
The previous prime is 13013320219. The next prime is 13013320223. The reversal of 13013320221 is 12202331031.
It is an interprime number because it is at equal distance from previous prime (13013320219) and next prime (13013320223).
It is not a de Polignac number, because 13013320221 - 21 = 13013320219 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13013320194 and 13013320203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013320223) 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, 1988365 + ... + 1994898.
Almost surely, 213013320221 is an apocalyptic number.
13013320221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13013320221 is a deficient number, since it is larger than the sum of its proper divisors (8177644259).
13013320221 is a wasteful number, since it uses less digits than its factorization.
13013320221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3983294 (or 3983277 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 13013320221 its reverse (12202331031), we get a palindrome (25215651252).
The spelling of 13013320221 in words is "thirteen billion, thirteen million, three hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •