Base | Representation |
---|---|
bin | 1011001110011000… |
… | …0100010111010011 |
3 | 21202222200101112202 |
4 | 2303212010113103 |
5 | 22132323213021 |
6 | 1214553113415 |
7 | 134444636024 |
oct | 26346042723 |
9 | 7688611482 |
10 | 3013101011 |
11 | 13068a9428 |
12 | 7010b886b |
13 | 39032070b |
14 | 208256c4b |
15 | 1297d0a0b |
hex | b39845d3 |
3013101011 has 4 divisors (see below), whose sum is σ = 3024302400. Its totient is φ = 3001899624.
The previous prime is 3013100977. The next prime is 3013101023. The reversal of 3013101011 is 1101013103.
It is a happy number.
3013101011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3013101011 - 210 = 3013099987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3013100983 and 3013101001.
It is not an unprimeable number, because it can be changed into a prime (3013101211) 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, 5600291 + ... + 5600828.
It is an arithmetic number, because the mean of its divisors is an integer number (756075600).
Almost surely, 23013101011 is an apocalyptic number.
3013101011 is a deficient number, since it is larger than the sum of its proper divisors (11201389).
3013101011 is a wasteful number, since it uses less digits than its factorization.
3013101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11201388.
The product of its (nonzero) digits is 9, while the sum is 11.
The square root of 3013101011 is about 54891.7207873829. The cubic root of 3013101011 is about 1444.3459580054.
Adding to 3013101011 its reverse (1101013103), we get a palindrome (4114114114).
The spelling of 3013101011 in words is "three billion, thirteen million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •