Base | Representation |
---|---|
bin | 11000100101110100… |
… | …11100010011000001 |
3 | 1021002002021212020001 |
4 | 30102322130103001 |
5 | 204014231241113 |
6 | 10022013120001 |
7 | 645106644043 |
oct | 142272342301 |
9 | 37062255201 |
10 | 13202212033 |
11 | 566533933a |
12 | 2685489001 |
13 | 1325251aaa |
14 | 8d3565a93 |
15 | 5240967dd |
hex | 312e9c4c1 |
13202212033 has 4 divisors (see below), whose sum is σ = 13203700528. Its totient is φ = 13200723540.
The previous prime is 13202212031. The next prime is 13202212043. The reversal of 13202212033 is 33021220231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33021220231 = 283 ⋅116682757.
It is a cyclic number.
It is not a de Polignac number, because 13202212033 - 21 = 13202212031 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13202212033.
It is not an unprimeable number, because it can be changed into a prime (13202212031) 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, 730863 + ... + 748708.
It is an arithmetic number, because the mean of its divisors is an integer number (3300925132).
Almost surely, 213202212033 is an apocalyptic number.
It is an amenable number.
13202212033 is a deficient number, since it is larger than the sum of its proper divisors (1488495).
13202212033 is an equidigital number, since it uses as much as digits as its factorization.
13202212033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1488494.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 13202212033 its reverse (33021220231), we get a palindrome (46223432264).
The spelling of 13202212033 in words is "thirteen billion, two hundred two million, two hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •