Base | Representation |
---|---|
bin | 110000010100001001000… |
… | …001110110101110001111 |
3 | 102202101220202001102200211 |
4 | 300110021001312232033 |
5 | 413344142231413124 |
6 | 11021132213103251 |
7 | 461605455364264 |
oct | 60241101665617 |
9 | 12671822042624 |
10 | 3320161201039 |
11 | 10700884947a1 |
12 | 457577327b27 |
13 | 1b1122557767 |
14 | b69a78c326b |
15 | 5b571db1e94 |
hex | 30509076b8f |
3320161201039 has 16 divisors (see below), whose sum is σ = 3405961226592. Its totient is φ = 3235258668928.
The previous prime is 3320161200977. The next prime is 3320161201043. The reversal of 3320161201039 is 9301021610233.
It is a cyclic number.
It is not a de Polignac number, because 3320161201039 - 227 = 3320026983311 is a prime.
It is a super-2 number, since 2×33201612010392 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3320161201039.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3320161204039) 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 15 ways as a sum of consecutive naturals, for example, 8491857 + ... + 8874229.
It is an arithmetic number, because the mean of its divisors is an integer number (212872576662).
Almost surely, 23320161201039 is an apocalyptic number.
3320161201039 is a deficient number, since it is larger than the sum of its proper divisors (85800025553).
3320161201039 is a wasteful number, since it uses less digits than its factorization.
3320161201039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383546.
The product of its (nonzero) digits is 5832, while the sum is 31.
The spelling of 3320161201039 in words is "three trillion, three hundred twenty billion, one hundred sixty-one million, two hundred one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •