Base | Representation |
---|---|
bin | 1011001110011000… |
… | …1100001100111001 |
3 | 21202222202000120201 |
4 | 2303212030030321 |
5 | 22132330224423 |
6 | 1214553522201 |
7 | 134445131434 |
oct | 26346141471 |
9 | 7688660521 |
10 | 3013133113 |
11 | 1306920561 |
12 | 701113361 |
13 | 390332203 |
14 | 20826481b |
15 | 1297da2ad |
hex | b398c339 |
3013133113 has 2 divisors, whose sum is σ = 3013133114. Its totient is φ = 3013133112.
The previous prime is 3013133111. The next prime is 3013133143. The reversal of 3013133113 is 3113313103.
It is a happy number.
3013133113 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., 2107544464 + 905588649 = 45908^2 + 30093^2 .
It is a cyclic number.
It is not a de Polignac number, because 3013133113 - 21 = 3013133111 is a prime.
Together with 3013133111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3013133111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506566556 + 1506566557.
It is an arithmetic number, because the mean of its divisors is an integer number (1506566557).
Almost surely, 23013133113 is an apocalyptic number.
It is an amenable number.
3013133113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3013133113 is an equidigital number, since it uses as much as digits as its factorization.
3013133113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243, while the sum is 19.
The square root of 3013133113 is about 54892.0131986430. The cubic root of 3013133113 is about 1444.3510874086.
Adding to 3013133113 its reverse (3113313103), we get a palindrome (6126446216).
The spelling of 3013133113 in words is "three billion, thirteen million, one hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •