Base | Representation |
---|---|
bin | 11110000101000000001… |
… | …111011001011011000101 |
3 | 21022121011210100021201222 |
4 | 132011000033121123011 |
5 | 232331112001004433 |
6 | 4221314050530125 |
7 | 302222060006042 |
oct | 36050017313305 |
9 | 7277153307658 |
10 | 2066957047493 |
11 | 727656405678 |
12 | 29470b896945 |
13 | 11cbb4438ac0 |
14 | 720812bc1c9 |
15 | 38b763b2b98 |
hex | 1e1403d96c5 |
2066957047493 has 8 divisors (see below), whose sum is σ = 2225992570368. Its totient is φ = 1907927071344.
The previous prime is 2066957047489. The next prime is 2066957047511. The reversal of 2066957047493 is 3947407596602.
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 2066957047493 - 22 = 2066957047489 is a prime.
It is a super-2 number, since 2×20669570474932 (a number of 25 digits) 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 (2066957047483) 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 in 7 ways as a sum of consecutive naturals, for example, 596021 + ... + 2118762.
It is an arithmetic number, because the mean of its divisors is an integer number (278249071296).
Almost surely, 22066957047493 is an apocalyptic number.
It is an amenable number.
2066957047493 is a deficient number, since it is larger than the sum of its proper divisors (159035522875).
2066957047493 is a wasteful number, since it uses less digits than its factorization.
2066957047493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2773363.
The product of its (nonzero) digits is 68584320, while the sum is 62.
The spelling of 2066957047493 in words is "two trillion, sixty-six billion, nine hundred fifty-seven million, forty-seven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •