Base | Representation |
---|---|
bin | 110000010011100000001… |
… | …110111000001011011101 |
3 | 102202100011001010200001002 |
4 | 300103200032320023131 |
5 | 413341242021432041 |
6 | 11020540243000045 |
7 | 461552504550326 |
oct | 60234016701335 |
9 | 12670131120032 |
10 | 3319476749021 |
11 | 106a8670a4874 |
12 | 457406069025 |
13 | 1b1043800274 |
14 | b6940a3544d |
15 | 5b531c6159b |
hex | 304e03b82dd |
3319476749021 has 2 divisors, whose sum is σ = 3319476749022. Its totient is φ = 3319476749020.
The previous prime is 3319476748909. The next prime is 3319476749027. The reversal of 3319476749021 is 1209476749133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1926460720900 + 1393016028121 = 1387970^2 + 1180261^2 .
It is a cyclic number.
It is not a de Polignac number, because 3319476749021 - 234 = 3302296879837 is a prime.
It is a super-2 number, since 2×33194767490212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3319476749027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1659738374510 + 1659738374511.
It is an arithmetic number, because the mean of its divisors is an integer number (1659738374511).
Almost surely, 23319476749021 is an apocalyptic number.
It is an amenable number.
3319476749021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3319476749021 is an equidigital number, since it uses as much as digits as its factorization.
3319476749021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6858432, while the sum is 56.
The spelling of 3319476749021 in words is "three trillion, three hundred nineteen billion, four hundred seventy-six million, seven hundred forty-nine thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •