Base | Representation |
---|---|
bin | 11000110001100110… |
… | …10101111011001101 |
3 | 1021022222012112100100 |
4 | 30120303111323031 |
5 | 204220024423341 |
6 | 10035502521313 |
7 | 650416520055 |
oct | 143063257315 |
9 | 37288175310 |
10 | 13301014221 |
11 | 5706091940 |
12 | 26b2596239 |
13 | 133c866321 |
14 | 902724565 |
15 | 52cab13b6 |
hex | 318cd5ecd |
13301014221 has 48 divisors (see below), whose sum is σ = 21834671040. Its totient is φ = 7731168000.
The previous prime is 13301014211. The next prime is 13301014271. The reversal of 13301014221 is 12241010331.
It is not a de Polignac number, because 13301014221 - 26 = 13301014157 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13301014194 and 13301014203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301014211) 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 47 ways as a sum of consecutive naturals, for example, 211711 + ... + 267251.
It is an arithmetic number, because the mean of its divisors is an integer number (454888980).
Almost surely, 213301014221 is an apocalyptic number.
13301014221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13301014221 is a deficient number, since it is larger than the sum of its proper divisors (8533656819).
13301014221 is a wasteful number, since it uses less digits than its factorization.
13301014221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55658 (or 55655 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13301014221 its reverse (12241010331), we get a palindrome (25542024552).
The spelling of 13301014221 in words is "thirteen billion, three hundred one million, fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •