Base | Representation |
---|---|
bin | 1011010100110110… |
… | …0000100000011001 |
3 | 21211212201000211211 |
4 | 2311031200200121 |
5 | 22211243421423 |
6 | 1221402223121 |
7 | 135224263513 |
oct | 26515404031 |
9 | 7755630754 |
10 | 3040217113 |
11 | 132013a12a |
12 | 70a1b4aa1 |
13 | 395b25b4b |
14 | 20bab4bb3 |
15 | 12bd8a10d |
hex | b5360819 |
3040217113 has 8 divisors (see below), whose sum is σ = 3231300800. Its totient is φ = 2852240688.
The previous prime is 3040217107. The next prime is 3040217123. The reversal of 3040217113 is 3117120403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3040217113 - 229 = 2503346201 is a prime.
It is a super-3 number, since 3×30402171133 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3040217123) 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, 774798 + ... + 778711.
It is an arithmetic number, because the mean of its divisors is an integer number (403912600).
Almost surely, 23040217113 is an apocalyptic number.
It is an amenable number.
3040217113 is a deficient number, since it is larger than the sum of its proper divisors (191083687).
3040217113 is a wasteful number, since it uses less digits than its factorization.
3040217113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1553631.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 3040217113 is about 55138.1638522720. The cubic root of 3040217113 is about 1448.6657743460.
Adding to 3040217113 its reverse (3117120403), we get a palindrome (6157337516).
The spelling of 3040217113 in words is "three billion, forty million, two hundred seventeen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •