Base | Representation |
---|---|
bin | 10101000011000100… |
… | …00110010010010101 |
3 | 1002011111221201202012 |
4 | 22201202012102111 |
5 | 141120300130023 |
6 | 5105142154005 |
7 | 550011313013 |
oct | 124142062225 |
9 | 32144851665 |
10 | 11300005013 |
11 | 4879616020 |
12 | 2234422905 |
13 | 10b11277cb |
14 | 792a858b3 |
15 | 46209e978 |
hex | 2a1886495 |
11300005013 has 8 divisors (see below), whose sum is σ = 12328114656. Its totient is φ = 10272034800.
The previous prime is 11300004971. The next prime is 11300005019. The reversal of 11300005013 is 31050000311.
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-11300005013 is a prime.
It is a super-2 number, since 2×113000050132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11300005019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 208523 + ... + 257063.
It is an arithmetic number, because the mean of its divisors is an integer number (1541014332).
Almost surely, 211300005013 is an apocalyptic number.
It is an amenable number.
11300005013 is a deficient number, since it is larger than the sum of its proper divisors (1028109643).
11300005013 is a wasteful number, since it uses less digits than its factorization.
11300005013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69715.
The product of its (nonzero) digits is 45, while the sum is 14.
Adding to 11300005013 its reverse (31050000311), we get a palindrome (42350005324).
The spelling of 11300005013 in words is "eleven billion, three hundred million, five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •