Base | Representation |
---|---|
bin | 111100000000000… |
… | …1000110011111101 |
3 | 12012022101100011020 |
4 | 1320000020303331 |
5 | 13110401131023 |
6 | 531440014353 |
7 | 100614533112 |
oct | 17000106375 |
9 | 5168340136 |
10 | 2013302013 |
11 | 943502668 |
12 | 4823013b9 |
13 | 261153b88 |
14 | 15155c909 |
15 | bbb3dde3 |
hex | 78008cfd |
2013302013 has 4 divisors (see below), whose sum is σ = 2684402688. Its totient is φ = 1342201340.
The previous prime is 2013301999. The next prime is 2013302021. The reversal of 2013302013 is 3102033102.
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 not a de Polignac number, because 2013302013 - 26 = 2013301949 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2013301983 and 2013302001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013302063) 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, 335550333 + ... + 335550338.
It is an arithmetic number, because the mean of its divisors is an integer number (671100672).
Almost surely, 22013302013 is an apocalyptic number.
It is an amenable number.
2013302013 is a deficient number, since it is larger than the sum of its proper divisors (671100675).
2013302013 is an equidigital number, since it uses as much as digits as its factorization.
2013302013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 671100674.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 2013302013 is about 44869.8341093434. The cubic root of 2013302013 is about 1262.7081277370.
Adding to 2013302013 its reverse (3102033102), we get a palindrome (5115335115).
The spelling of 2013302013 in words is "two billion, thirteen million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.340 sec. • engine limits •