Base | Representation |
---|---|
bin | 111100011000110… |
… | …010001100011011 |
3 | 2121121101100002202 |
4 | 330120302030123 |
5 | 4033330130021 |
6 | 244310520415 |
7 | 34051314545 |
oct | 7430621433 |
9 | 2547340082 |
10 | 1013130011 |
11 | 47a981633 |
12 | 24336610b |
13 | 131b8661a |
14 | 987a8695 |
15 | 5de26a0b |
hex | 3c63231b |
1013130011 has 4 divisors (see below), whose sum is σ = 1072725912. Its totient is φ = 953534112.
The previous prime is 1013130007. The next prime is 1013130017. The reversal of 1013130011 is 1100313101.
It is a happy number.
1013130011 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 1013130011 - 22 = 1013130007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013129974 and 1013130001.
It is not an unprimeable number, because it can be changed into a prime (1013130017) 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, 29797925 + ... + 29797958.
It is an arithmetic number, because the mean of its divisors is an integer number (268181478).
Almost surely, 21013130011 is an apocalyptic number.
1013130011 is a deficient number, since it is larger than the sum of its proper divisors (59595901).
1013130011 is an equidigital number, since it uses as much as digits as its factorization.
1013130011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59595900.
The product of its (nonzero) digits is 9, while the sum is 11.
The square root of 1013130011 is about 31829.7032816833. The cubic root of 1013130011 is about 1004.3576536057.
Adding to 1013130011 its reverse (1100313101), we get a palindrome (2113443112).
The spelling of 1013130011 in words is "one billion, thirteen million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •