Base | Representation |
---|---|
bin | 1011001100110100… |
… | …01100101011110111 |
3 | 120112001201200121222 |
4 | 11212122030223313 |
5 | 44303324023111 |
6 | 2432401500555 |
7 | 302003412644 |
oct | 54632145367 |
9 | 16461650558 |
10 | 6013111031 |
11 | 2606276354 |
12 | 11b994175b |
13 | 74aa09685 |
14 | 410862dcb |
15 | 252d777db |
hex | 16668caf7 |
6013111031 has 4 divisors (see below), whose sum is σ = 6014405232. Its totient is φ = 6011816832.
The previous prime is 6013111019. The next prime is 6013111061. The reversal of 6013111031 is 1301113106.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 6013111031 - 26 = 6013110967 is a prime.
It is a super-2 number, since 2×60131110312 = 72315008542267765922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6013111061) 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 3 ways as a sum of consecutive naturals, for example, 640106 + ... + 649431.
It is an arithmetic number, because the mean of its divisors is an integer number (1503601308).
Almost surely, 26013111031 is an apocalyptic number.
6013111031 is a deficient number, since it is larger than the sum of its proper divisors (1294201).
6013111031 is a wasteful number, since it uses less digits than its factorization.
6013111031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1294200.
The product of its (nonzero) digits is 54, while the sum is 17.
The square root of 6013111031 is about 77544.2520822788. The cubic root of 6013111031 is about 1818.4432035013.
Adding to 6013111031 its reverse (1301113106), we get a palindrome (7314224137).
The spelling of 6013111031 in words is "six billion, thirteen million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •