Base | Representation |
---|---|
bin | 1011010000010101… |
… | …1101011001101111 |
3 | 21210120011110122021 |
4 | 2310011131121233 |
5 | 22141430030111 |
6 | 1215445331011 |
7 | 134604611236 |
oct | 26405353157 |
9 | 7716143567 |
10 | 3021330031 |
11 | 1310509a75 |
12 | 703a06a67 |
13 | 391c42165 |
14 | 209399b1d |
15 | 12a3a8d71 |
hex | b415d66f |
3021330031 has 8 divisors (see below), whose sum is σ = 3081700080. Its totient is φ = 2961084672.
The previous prime is 3021330023. The next prime is 3021330043. The reversal of 3021330031 is 1300331203.
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 3021330031 - 23 = 3021330023 is a prime.
It is a super-2 number, since 2×30213300312 = 18256870312444921922, 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 = 3021329987 and 3021330014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3021330331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18556 + ... + 79918.
It is an arithmetic number, because the mean of its divisors is an integer number (385212510).
Almost surely, 23021330031 is an apocalyptic number.
3021330031 is a deficient number, since it is larger than the sum of its proper divisors (60370049).
3021330031 is an equidigital number, since it uses as much as digits as its factorization.
3021330031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62345.
The product of its (nonzero) digits is 162, while the sum is 16.
The square root of 3021330031 is about 54966.6265200985. The cubic root of 3021330031 is about 1445.6596376097.
Adding to 3021330031 its reverse (1300331203), we get a palindrome (4321661234).
The spelling of 3021330031 in words is "three billion, twenty-one million, three hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •