Base | Representation |
---|---|
bin | 1011001011110100… |
… | …1111110100001101 |
3 | 21202020112201112111 |
4 | 2302331033310031 |
5 | 22122103300023 |
6 | 1213531504021 |
7 | 134254656544 |
oct | 26275176415 |
9 | 7666481474 |
10 | 3002400013 |
11 | 130085a628 |
12 | 6b95b8011 |
13 | 38b044a72 |
14 | 206a6d15b |
15 | 1288ba00d |
hex | b2f4fd0d |
3002400013 has 8 divisors (see below), whose sum is σ = 3133827648. Its totient is φ = 2871046464.
The previous prime is 3002400001. The next prime is 3002400017. The reversal of 3002400013 is 3100042003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3002400013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3002399966 and 3002400002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3002400017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74245 + ... + 107317.
It is an arithmetic number, because the mean of its divisors is an integer number (391728456).
Almost surely, 23002400013 is an apocalyptic number.
It is an amenable number.
3002400013 is a deficient number, since it is larger than the sum of its proper divisors (131427635).
3002400013 is a wasteful number, since it uses less digits than its factorization.
3002400013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37043.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 3002400013 is about 54794.1603914140. The cubic root of 3002400013 is about 1442.6340697606.
Adding to 3002400013 its reverse (3100042003), we get a palindrome (6102442016).
The spelling of 3002400013 in words is "three billion, two million, four hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •