Base | Representation |
---|---|
bin | 11000100101110011… |
… | …10000011000000101 |
3 | 1021002001221201110002 |
4 | 30102321300120011 |
5 | 204014210012013 |
6 | 10022005211045 |
7 | 645105264413 |
oct | 142271603005 |
9 | 37061851402 |
10 | 13202032133 |
11 | 5665226164 |
12 | 2685400a85 |
13 | 13251bac44 |
14 | 8d351a2b3 |
15 | 52405d358 |
hex | 312e70605 |
13202032133 has 8 divisors (see below), whose sum is σ = 13246785240. Its totient is φ = 13157337600.
The previous prime is 13202032127. The next prime is 13202032139. The reversal of 13202032133 is 33123020231.
It is an interprime number because it is at equal distance from previous prime (13202032127) and next prime (13202032139).
It can be written as a sum of positive squares in 4 ways, for example, as 274796929 + 12927235204 = 16577^2 + 113698^2 .
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 13202032133 - 26 = 13202032069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202032139) 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, 462953 + ... + 490641.
It is an arithmetic number, because the mean of its divisors is an integer number (1655848155).
Almost surely, 213202032133 is an apocalyptic number.
It is an amenable number.
13202032133 is a deficient number, since it is larger than the sum of its proper divisors (44753107).
13202032133 is a wasteful number, since it uses less digits than its factorization.
13202032133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29287.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13202032133 its reverse (33123020231), we get a palindrome (46325052364).
The spelling of 13202032133 in words is "thirteen billion, two hundred two million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •