Base | Representation |
---|---|
bin | 11000010001100010… |
… | …01001001010100101 |
3 | 1020122020000022020122 |
4 | 30020301021022211 |
5 | 203142143032323 |
6 | 5553053011325 |
7 | 640642122356 |
oct | 141061111245 |
9 | 36566008218 |
10 | 13032002213 |
11 | 558825316a |
12 | 2638483b45 |
13 | 12c8bc8119 |
14 | 8b8ad9d2d |
15 | 514173ec8 |
hex | 308c492a5 |
13032002213 has 4 divisors (see below), whose sum is σ = 13032421920. Its totient is φ = 13031582508.
The previous prime is 13032002201. The next prime is 13032002219. The reversal of 13032002213 is 31220023031.
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.
It is a cyclic number.
It is not a de Polignac number, because 13032002213 - 216 = 13031936677 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13032002191 and 13032002200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032002219) 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 3 ways as a sum of consecutive naturals, for example, 159203 + ... + 226736.
It is an arithmetic number, because the mean of its divisors is an integer number (3258105480).
Almost surely, 213032002213 is an apocalyptic number.
It is an amenable number.
13032002213 is a deficient number, since it is larger than the sum of its proper divisors (419707).
13032002213 is an equidigital number, since it uses as much as digits as its factorization.
13032002213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419706.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 13032002213 its reverse (31220023031), we get a palindrome (44252025244).
The spelling of 13032002213 in words is "thirteen billion, thirty-two million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •