Base | Representation |
---|---|
bin | 11000110100000110… |
… | …11001111100110111 |
3 | 1021101102200211111001 |
4 | 30122003121330313 |
5 | 204240413032411 |
6 | 10041532424131 |
7 | 651063102436 |
oct | 143203317467 |
9 | 37342624431 |
10 | 13322002231 |
11 | 5716a174aa |
12 | 26b9618047 |
13 | 1344004375 |
14 | 90542911d |
15 | 52e859dc1 |
hex | 31a0d9f37 |
13322002231 has 4 divisors (see below), whose sum is σ = 13322518312. Its totient is φ = 13321486152.
The previous prime is 13322002207. The next prime is 13322002237. The reversal of 13322002231 is 13220022331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13322002231 - 217 = 13321871159 is a prime.
It is a super-2 number, since 2×133220022312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13322002199 and 13322002208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13322002237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 217161 + ... + 271666.
It is an arithmetic number, because the mean of its divisors is an integer number (3330629578).
Almost surely, 213322002231 is an apocalyptic number.
13322002231 is a deficient number, since it is larger than the sum of its proper divisors (516081).
13322002231 is an equidigital number, since it uses as much as digits as its factorization.
13322002231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516080.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 13322002231 its reverse (13220022331), we get a palindrome (26542024562).
The spelling of 13322002231 in words is "thirteen billion, three hundred twenty-two million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •