Base | Representation |
---|---|
bin | 1011001110100110… |
… | …0111011100001001 |
3 | 21210001102122101222 |
4 | 2303221213130021 |
5 | 22133042443423 |
6 | 1215025051425 |
7 | 134455561502 |
oct | 26351473411 |
9 | 7701378358 |
10 | 3014031113 |
11 | 1307384205 |
12 | 701486b75 |
13 | 390587b82 |
14 | 208419ba9 |
15 | 1299163c8 |
hex | b3a67709 |
3014031113 has 8 divisors (see below), whose sum is σ = 3192019008. Its totient is φ = 2839955184.
The previous prime is 3014031109. The next prime is 3014031127. The reversal of 3014031113 is 3111304103.
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 3014031113 - 22 = 3014031109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3014031091 and 3014031100.
It is not an unprimeable number, because it can be changed into a prime (3014031143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 976406 + ... + 979487.
It is an arithmetic number, because the mean of its divisors is an integer number (399002376).
Almost surely, 23014031113 is an apocalyptic number.
It is an amenable number.
3014031113 is a deficient number, since it is larger than the sum of its proper divisors (177987895).
3014031113 is a wasteful number, since it uses less digits than its factorization.
3014031113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1955983.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 3014031113 is about 54900.1922856378. The cubic root of 3014031113 is about 1444.4945591591.
Adding to 3014031113 its reverse (3111304103), we get a palindrome (6125335216).
The spelling of 3014031113 in words is "three billion, fourteen million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •