Base | Representation |
---|---|
bin | 11000110001101110… |
… | …00111011001100101 |
3 | 1021100001001210002221 |
4 | 30120313013121211 |
5 | 204220303101201 |
6 | 10035540032341 |
7 | 650431106506 |
oct | 143067073145 |
9 | 37301053087 |
10 | 13302003301 |
11 | 57066a7a64 |
12 | 26b29926b1 |
13 | 133cb21592 |
14 | 902900bad |
15 | 52cc094a1 |
hex | 318dc7665 |
13302003301 has 4 divisors (see below), whose sum is σ = 13760693100. Its totient is φ = 12843313504.
The previous prime is 13302003271. The next prime is 13302003343. The reversal of 13302003301 is 10330020331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10330020331 = 10979 ⋅940889.
It can be written as a sum of positive squares in 2 ways, for example, as 10964184100 + 2337819201 = 104710^2 + 48351^2 .
It is a cyclic number.
It is not a de Polignac number, because 13302003301 - 217 = 13301872229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13302003361) 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, 229344856 + ... + 229344913.
It is an arithmetic number, because the mean of its divisors is an integer number (3440173275).
Almost surely, 213302003301 is an apocalyptic number.
It is an amenable number.
13302003301 is a deficient number, since it is larger than the sum of its proper divisors (458689799).
13302003301 is an equidigital number, since it uses as much as digits as its factorization.
13302003301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458689798.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 13302003301 its reverse (10330020331), we get a palindrome (23632023632).
The spelling of 13302003301 in words is "thirteen billion, three hundred two million, three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •