Base | Representation |
---|---|
bin | 11000100110000100… |
… | …11010010101000001 |
3 | 1021002020012222220200 |
4 | 30103002122111001 |
5 | 204020300113441 |
6 | 10022125555413 |
7 | 645133464504 |
oct | 142302322501 |
9 | 37066188820 |
10 | 13204301121 |
11 | 5666535960 |
12 | 2686115b69 |
13 | 132580393b |
14 | 8d394b13b |
15 | 52435a7b6 |
hex | 31309a541 |
13204301121 has 24 divisors (see below), whose sum is σ = 21199366656. Its totient is φ = 7851611040.
The previous prime is 13204301087. The next prime is 13204301147. The reversal of 13204301121 is 12110340231.
It is not a de Polignac number, because 13204301121 - 221 = 13202203969 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13204301094 and 13204301103.
It is not an unprimeable number, because it can be changed into a prime (13204301221) 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 23 ways as a sum of consecutive naturals, for example, 1253025 + ... + 1263518.
It is an arithmetic number, because the mean of its divisors is an integer number (883306944).
Almost surely, 213204301121 is an apocalyptic number.
13204301121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13204301121 is a deficient number, since it is larger than the sum of its proper divisors (7995065535).
13204301121 is a wasteful number, since it uses less digits than its factorization.
13204301121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2516613 (or 2516610 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13204301121 its reverse (12110340231), we get a palindrome (25314641352).
The spelling of 13204301121 in words is "thirteen billion, two hundred four million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •