Base | Representation |
---|---|
bin | 1011010011100000… |
… | …1110111010011111 |
3 | 21211111012200112020 |
4 | 2310320032322133 |
5 | 22203331440111 |
6 | 1221042511223 |
7 | 135126005013 |
oct | 26470167237 |
9 | 7744180466 |
10 | 3034640031 |
11 | 1317a7aa75 |
12 | 708365513 |
13 | 3949224b7 |
14 | 20b062543 |
15 | 12b637906 |
hex | b4e0ee9f |
3034640031 has 8 divisors (see below), whose sum is σ = 4091649840. Its totient is φ = 2000361792.
The previous prime is 3034639931. The next prime is 3034640093. The reversal of 3034640031 is 1300464303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3034640031 - 210 = 3034639007 is a prime.
It is a super-2 number, since 2×30346400312 = 18418080235495361922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3034639983 and 3034640010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3034640431) 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, 5682580 + ... + 5683113.
It is an arithmetic number, because the mean of its divisors is an integer number (511456230).
Almost surely, 23034640031 is an apocalyptic number.
3034640031 is a deficient number, since it is larger than the sum of its proper divisors (1057009809).
3034640031 is a wasteful number, since it uses less digits than its factorization.
3034640031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11365785.
The product of its (nonzero) digits is 2592, while the sum is 24.
The square root of 3034640031 is about 55087.5669366510. The cubic root of 3034640031 is about 1447.7794041856.
The spelling of 3034640031 in words is "three billion, thirty-four million, six hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •