Base | Representation |
---|---|
bin | 101100101000011001010… |
… | …010100010011100000101 |
3 | 101212012112122210210212012 |
4 | 230220121102202130011 |
5 | 400222234410030042 |
6 | 10304550301104005 |
7 | 434404612561265 |
oct | 54503122423405 |
9 | 11765478723765 |
10 | 3067030939397 |
11 | a827a200a657 |
12 | 4164b2558005 |
13 | 1932b1b06759 |
14 | a863347b7a5 |
15 | 54ba9372e82 |
hex | 2ca194a2705 |
3067030939397 has 4 divisors (see below), whose sum is σ = 3067048396620. Its totient is φ = 3067013482176.
The previous prime is 3067030939363. The next prime is 3067030939421. The reversal of 3067030939397 is 7939390307603.
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 233821569601 + 2833209369796 = 483551^2 + 1683214^2 .
It is a cyclic number.
It is not a de Polignac number, because 3067030939397 - 222 = 3067026745093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3067030939097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8462372 + ... + 8817357.
It is an arithmetic number, because the mean of its divisors is an integer number (766762099155).
Almost surely, 23067030939397 is an apocalyptic number.
It is an amenable number.
3067030939397 is a deficient number, since it is larger than the sum of its proper divisors (17457223).
3067030939397 is a wasteful number, since it uses less digits than its factorization.
3067030939397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17457222.
The product of its (nonzero) digits is 17360406, while the sum is 59.
The spelling of 3067030939397 in words is "three trillion, sixty-seven billion, thirty million, nine hundred thirty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •