Base | Representation |
---|---|
bin | 110000010100010011101… |
… | …100011000100110110000 |
3 | 102202102101012201120011021 |
4 | 300110103230120212300 |
5 | 413400024032401112 |
6 | 11021202044025224 |
7 | 461613060236653 |
oct | 60242354304660 |
9 | 12672335646137 |
10 | 3320340122032 |
11 | 107016a48a78a |
12 | 457607232214 |
13 | 1b115064147b |
14 | b69c357989a |
15 | 5b582955907 |
hex | 30513b189b0 |
3320340122032 has 40 divisors (see below), whose sum is σ = 6651767116800. Its totient is φ = 1603933880640.
The previous prime is 3320340122027. The next prime is 3320340122051. The reversal of 3320340122032 is 2302210430233.
It is a super-2 number, since 2×33203401220322 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3320340121988 and 3320340122006.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 5290738 + ... + 5884945.
It is an arithmetic number, because the mean of its divisors is an integer number (166294177920).
Almost surely, 23320340122032 is an apocalyptic number.
It is an amenable number.
3320340122032 is an abundant number, since it is smaller than the sum of its proper divisors (3331426994768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3320340122032 is a wasteful number, since it uses less digits than its factorization.
3320340122032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11176321 (or 11176315 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 3320340122032 its reverse (2302210430233), we get a palindrome (5622550552265).
The spelling of 3320340122032 in words is "three trillion, three hundred twenty billion, three hundred forty million, one hundred twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •