Base | Representation |
---|---|
bin | 1100100010000101… |
… | …1011000101001001 |
3 | 22200110100022111111 |
4 | 3020201123011021 |
5 | 23342214023443 |
6 | 1313454330321 |
7 | 146240161321 |
oct | 31041330511 |
9 | 8613308444 |
10 | 3364204873 |
11 | 1477007a07 |
12 | 79a7b99a1 |
13 | 417ca2193 |
14 | 23cb30281 |
15 | 14a53669d |
hex | c885b149 |
3364204873 has 2 divisors, whose sum is σ = 3364204874. Its totient is φ = 3364204872.
The previous prime is 3364204829. The next prime is 3364204903. The reversal of 3364204873 is 3784024633.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2931897609 + 432307264 = 54147^2 + 20792^2 .
It is an emirp because it is prime and its reverse (3784024633) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3364204873 - 213 = 3364196681 is a prime.
It is a super-2 number, since 2×33642048732 = 22635748855033892258, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3364214873) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1682102436 + 1682102437.
It is an arithmetic number, because the mean of its divisors is an integer number (1682102437).
Almost surely, 23364204873 is an apocalyptic number.
It is an amenable number.
3364204873 is a deficient number, since it is larger than the sum of its proper divisors (1).
3364204873 is an equidigital number, since it uses as much as digits as its factorization.
3364204873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 40.
The square root of 3364204873 is about 58001.7661196623. The cubic root of 3364204873 is about 1498.3990137626.
The spelling of 3364204873 in words is "three billion, three hundred sixty-four million, two hundred four thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •