Base | Representation |
---|---|
bin | 1011001101101001… |
… | …0010011110111001 |
3 | 21202202212111202011 |
4 | 2303122102132321 |
5 | 22131030404423 |
6 | 1214403005521 |
7 | 134406455302 |
oct | 26332223671 |
9 | 7682774664 |
10 | 3010013113 |
11 | 130508a448 |
12 | 7000698a1 |
13 | 38c7ac063 |
14 | 207a917a9 |
15 | 1293c0b0d |
hex | b36927b9 |
3010013113 has 4 divisors (see below), whose sum is σ = 3011726080. Its totient is φ = 3008300148.
The previous prime is 3010013093. The next prime is 3010013137. The reversal of 3010013113 is 3113100103.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3010013113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3010013093 and 3010013102.
It is not an unprimeable number, because it can be changed into a prime (3010013173) 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, 853845 + ... + 857362.
It is an arithmetic number, because the mean of its divisors is an integer number (752931520).
Almost surely, 23010013113 is an apocalyptic number.
It is an amenable number.
3010013113 is a deficient number, since it is larger than the sum of its proper divisors (1712967).
3010013113 is a wasteful number, since it uses less digits than its factorization.
3010013113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1712966.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 3010013113 is about 54863.5864030050. The cubic root of 3010013113 is about 1443.8523892628.
Adding to 3010013113 its reverse (3113100103), we get a palindrome (6123113216).
The spelling of 3010013113 in words is "three billion, ten million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •