Base | Representation |
---|---|
bin | 1011100110001100… |
… | …1010010011011001 |
3 | 22000221122220012211 |
4 | 2321203022103121 |
5 | 22333412032301 |
6 | 1232522235121 |
7 | 140100040111 |
oct | 27143122331 |
9 | 8027586184 |
10 | 3113002201 |
11 | 13582326a1 |
12 | 72a655aa1 |
13 | 3a7c2b24a |
14 | 217620041 |
15 | 133466051 |
hex | b98ca4d9 |
3113002201 has 2 divisors, whose sum is σ = 3113002202. Its totient is φ = 3113002200.
The previous prime is 3113002181. The next prime is 3113002267. The reversal of 3113002201 is 1022003113.
3113002201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2049916176 + 1063086025 = 45276^2 + 32605^2 .
It is an emirp because it is prime and its reverse (1022003113) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3113002201 is a prime.
It is not a weakly prime, because it can be changed into another prime (3113002001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1556501100 + 1556501101.
It is an arithmetic number, because the mean of its divisors is an integer number (1556501101).
Almost surely, 23113002201 is an apocalyptic number.
It is an amenable number.
3113002201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113002201 is an equidigital number, since it uses as much as digits as its factorization.
3113002201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 3113002201 is about 55794.2846624993. The cubic root of 3113002201 is about 1460.1354413976.
Adding to 3113002201 its reverse (1022003113), we get a palindrome (4135005314).
The spelling of 3113002201 in words is "three billion, one hundred thirteen million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •