Base | Representation |
---|---|
bin | 11000110001110000… |
… | …10010010011101001 |
3 | 1021100001122100222122 |
4 | 30120320102103221 |
5 | 204220342410441 |
6 | 10035550401025 |
7 | 650433525152 |
oct | 143070222351 |
9 | 37301570878 |
10 | 13302310121 |
11 | 5706897531 |
12 | 26b2b00175 |
13 | 133cbcb129 |
14 | 902980929 |
15 | 52cc6a34b |
hex | 318e124e9 |
13302310121 has 4 divisors (see below), whose sum is σ = 13761010500. Its totient is φ = 12843609744.
The previous prime is 13302310117. The next prime is 13302310139. The reversal of 13302310121 is 12101320331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4126777600 + 9175532521 = 64240^2 + 95789^2 .
It is a cyclic number.
It is not a de Polignac number, because 13302310121 - 22 = 13302310117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13302310121.
It is not an unprimeable number, because it can be changed into a prime (13302310111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 229350146 + ... + 229350203.
It is an arithmetic number, because the mean of its divisors is an integer number (3440252625).
Almost surely, 213302310121 is an apocalyptic number.
It is an amenable number.
13302310121 is a deficient number, since it is larger than the sum of its proper divisors (458700379).
13302310121 is an equidigital number, since it uses as much as digits as its factorization.
13302310121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458700378.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13302310121 its reverse (12101320331), we get a palindrome (25403630452).
The spelling of 13302310121 in words is "thirteen billion, three hundred two million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •