Base | Representation |
---|---|
bin | 11000101000001101… |
… | …01100101100010101 |
3 | 1021010110220110111010 |
4 | 30110012230230111 |
5 | 204034340432013 |
6 | 10024005402433 |
7 | 645441602160 |
oct | 142406545425 |
9 | 37113813433 |
10 | 13222202133 |
11 | 5675652188 |
12 | 2690109419 |
13 | 132943085a |
14 | 8d608aad7 |
15 | 525be47c3 |
hex | 3141acb15 |
13222202133 has 8 divisors (see below), whose sum is σ = 20148117568. Its totient is φ = 7555544064.
The previous prime is 13222202117. The next prime is 13222202153. The reversal of 13222202133 is 33120222231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13222202133 - 24 = 13222202117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 629628673 = 13222202133 / (1 + 3 + 2 + 2 + 2 + 2 + 0 + 2 + 1 + 3 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13222202153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 314814316 + ... + 314814357.
It is an arithmetic number, because the mean of its divisors is an integer number (2518514696).
Almost surely, 213222202133 is an apocalyptic number.
It is an amenable number.
13222202133 is a deficient number, since it is larger than the sum of its proper divisors (6925915435).
13222202133 is an equidigital number, since it uses as much as digits as its factorization.
13222202133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629628683.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 13222202133 its reverse (33120222231), we get a palindrome (46342424364).
The spelling of 13222202133 in words is "thirteen billion, two hundred twenty-two million, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •