Base | Representation |
---|---|
bin | 11000101000001100… |
… | …10100100100100011 |
3 | 1021010110201102221210 |
4 | 30110012110210203 |
5 | 204034324301311 |
6 | 10024003321203 |
7 | 645441011133 |
oct | 142406244443 |
9 | 37113642853 |
10 | 13222103331 |
11 | 5675594a28 |
12 | 2690080203 |
13 | 13293c78a8 |
14 | 8d6062ac3 |
15 | 525bc53a6 |
hex | 314194923 |
13222103331 has 8 divisors (see below), whose sum is σ = 17643027024. Its totient is φ = 8807957600.
The previous prime is 13222103327. The next prime is 13222103347. The reversal of 13222103331 is 13330122231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13222103331 - 22 = 13222103327 is a prime.
It is a super-2 number, since 2×132221033312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13222103298 and 13222103307.
It is not an unprimeable number, because it can be changed into a prime (13222103381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1689936 + ... + 1697741.
It is an arithmetic number, because the mean of its divisors is an integer number (2205378378).
Almost surely, 213222103331 is an apocalyptic number.
13222103331 is a deficient number, since it is larger than the sum of its proper divisors (4420923693).
13222103331 is a wasteful number, since it uses less digits than its factorization.
13222103331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3388981.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13222103331 its reverse (13330122231), we get a palindrome (26552225562).
The spelling of 13222103331 in words is "thirteen billion, two hundred twenty-two million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •