Base | Representation |
---|---|
bin | 1011001100101101… |
… | …1111111011011111 |
3 | 21202111120112101112 |
4 | 2303023133323133 |
5 | 22124032323111 |
6 | 1214143532235 |
7 | 134331506663 |
oct | 26313377337 |
9 | 7674515345 |
10 | 3006136031 |
11 | 1302981548 |
12 | 6ba8ba07b |
13 | 38ba52422 |
14 | 2073628a3 |
15 | 128da6e8b |
hex | b32dfedf |
3006136031 has 8 divisors (see below), whose sum is σ = 3086823600. Its totient is φ = 2925799360.
The previous prime is 3006135997. The next prime is 3006136039. The reversal of 3006136031 is 1306316003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-3006136031 is a prime.
It is a super-2 number, since 2×30061360312 = 18073707673752865922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3006135988 and 3006136006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3006136039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70316 + ... + 104673.
It is an arithmetic number, because the mean of its divisors is an integer number (385852950).
Almost surely, 23006136031 is an apocalyptic number.
3006136031 is a deficient number, since it is larger than the sum of its proper divisors (80687569).
3006136031 is a wasteful number, since it uses less digits than its factorization.
3006136031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175449.
The product of its (nonzero) digits is 972, while the sum is 23.
The square root of 3006136031 is about 54828.2411809826. The cubic root of 3006136031 is about 1443.2321993484.
The spelling of 3006136031 in words is "three billion, six million, one hundred thirty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •