Base | Representation |
---|---|
bin | 101011101100001001011… |
… | …111010110111000101111 |
3 | 101122000120022221102210000 |
4 | 223230021133112320233 |
5 | 343142243341330210 |
6 | 10215131230515343 |
7 | 426624550306110 |
oct | 53541137267057 |
9 | 11560508842700 |
10 | 3002341355055 |
11 | a58316473459 |
12 | 405a5a065b53 |
13 | 18a1729245b3 |
14 | a5457c4c207 |
15 | 53170083ac0 |
hex | 2bb097d6e2f |
3002341355055 has 80 divisors (see below), whose sum is σ = 6157799391744. Its totient is φ = 1370943403200.
The previous prime is 3002341355023. The next prime is 3002341355077. The reversal of 3002341355055 is 5505531432003.
3002341355055 is a `hidden beast` number, since 30 + 0 + 23 + 4 + 1 + 3 + 550 + 55 = 666.
It is not a de Polignac number, because 3002341355055 - 25 = 3002341355023 is a prime.
It is a super-2 number, since 2×30023413550552 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 1903630 + ... + 3102980.
Almost surely, 23002341355055 is an apocalyptic number.
3002341355055 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3002341355055 is an abundant number, since it is smaller than the sum of its proper divisors (3155458036689).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3002341355055 is a wasteful number, since it uses less digits than its factorization.
3002341355055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1200258 (or 1200249 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 36.
Adding to 3002341355055 its reverse (5505531432003), we get a palindrome (8507872787058).
The spelling of 3002341355055 in words is "three trillion, two billion, three hundred forty-one million, three hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •