Base | Representation |
---|---|
bin | 1011001111001010… |
… | …1110110000101101 |
3 | 21210012221000212222 |
4 | 2303302232300231 |
5 | 22134200423042 |
6 | 1215152205125 |
7 | 134515102364 |
oct | 26362566055 |
9 | 7705830788 |
10 | 3016420397 |
11 | 1308766321 |
12 | 7022397a5 |
13 | 390c13553 |
14 | 20887c7db |
15 | 129c392d2 |
hex | b3caec2d |
3016420397 has 4 divisors (see below), whose sum is σ = 3019957500. Its totient is φ = 3012883296.
The previous prime is 3016420357. The next prime is 3016420403. The reversal of 3016420397 is 7930246103.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1803361156 + 1213059241 = 42466^2 + 34829^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3016420397 is a prime.
It is a super-2 number, since 2×30164203972 = 18197584022875275218, 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 (3016420327) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1767272 + ... + 1768977.
It is an arithmetic number, because the mean of its divisors is an integer number (754989375).
Almost surely, 23016420397 is an apocalyptic number.
It is an amenable number.
3016420397 is a deficient number, since it is larger than the sum of its proper divisors (3537103).
3016420397 is an equidigital number, since it uses as much as digits as its factorization.
3016420397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3537102.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 3016420397 is about 54921.9482265515. The cubic root of 3016420397 is about 1444.8761517878.
The spelling of 3016420397 in words is "three billion, sixteen million, four hundred twenty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •