Base | Representation |
---|---|
bin | 11000100110110010… |
… | …11000010100101101 |
3 | 1021002122112220022101 |
4 | 30103121120110231 |
5 | 204023320302341 |
6 | 10022503015101 |
7 | 645235612645 |
oct | 142331302455 |
9 | 37078486271 |
10 | 13210322221 |
11 | 5669978678 |
12 | 268813a491 |
13 | 1326b31415 |
14 | 8d4677525 |
15 | 524b49831 |
hex | 31365852d |
13210322221 has 8 divisors (see below), whose sum is σ = 13534356024. Its totient is φ = 12886375680.
The previous prime is 13210322219. The next prime is 13210322227. The reversal of 13210322221 is 12222301231.
It can be written as a sum of positive squares in 4 ways, for example, as 1570933225 + 11639388996 = 39635^2 + 107886^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 13210322221 - 21 = 13210322219 is a prime.
It is a super-2 number, since 2×132103222212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210322227) 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, 369675 + ... + 403831.
It is an arithmetic number, because the mean of its divisors is an integer number (1691794503).
Almost surely, 213210322221 is an apocalyptic number.
It is an amenable number.
13210322221 is a deficient number, since it is larger than the sum of its proper divisors (324033803).
13210322221 is an equidigital number, since it uses as much as digits as its factorization.
13210322221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43631.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 13210322221 its reverse (12222301231), we get a palindrome (25432623452).
The spelling of 13210322221 in words is "thirteen billion, two hundred ten million, three hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •