Base | Representation |
---|---|
bin | 1011100110001111… |
… | …1010100110000001 |
3 | 22000222000221112202 |
4 | 2321203322212001 |
5 | 22333434400001 |
6 | 1232530402545 |
7 | 140101522562 |
oct | 27143724601 |
9 | 8028027482 |
10 | 3113200001 |
11 | 135835826a |
12 | 72a730455 |
13 | 3a7c9a2a2 |
14 | 217672169 |
15 | 1334a496b |
hex | b98fa981 |
3113200001 has 2 divisors, whose sum is σ = 3113200002. Its totient is φ = 3113200000.
The previous prime is 3113199997. The next prime is 3113200003. The reversal of 3113200001 is 1000023113.
3113200001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3033365776 + 79834225 = 55076^2 + 8935^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113200001 - 22 = 3113199997 is a prime.
Together with 3113200003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3113200003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1556600000 + 1556600001.
It is an arithmetic number, because the mean of its divisors is an integer number (1556600001).
Almost surely, 23113200001 is an apocalyptic number.
It is an amenable number.
3113200001 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113200001 is an equidigital number, since it uses as much as digits as its factorization.
3113200001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 3113200001 is about 55796.0572173339. The cubic root of 3113200001 is about 1460.1663663862.
Adding to 3113200001 its reverse (1000023113), we get a palindrome (4113223114).
The spelling of 3113200001 in words is "three billion, one hundred thirteen million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •