Base | Representation |
---|---|
bin | 110000000010011001000… |
… | …000110001111101011100 |
3 | 102200120201110210210202120 |
4 | 300002121000301331130 |
5 | 413041124103031022 |
6 | 11004301052222540 |
7 | 460332246021333 |
oct | 60023100617534 |
9 | 12616643723676 |
10 | 3301102002012 |
11 | 1062a98025441 |
12 | 45393846aa50 |
13 | 1ac3a5a607b9 |
14 | b5aba538d1a |
15 | 5ad08a31d5c |
hex | 30099031f5c |
3301102002012 has 24 divisors (see below), whose sum is σ = 7773237133200. Its totient is φ = 1090272220416.
The previous prime is 3301102001969. The next prime is 3301102002017. The reversal of 3301102002012 is 2102002011033.
It is a junction number, because it is equal to n+sod(n) for n = 3301102001982 and 3301102002000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3301102002017) by changing a digit.
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, 1261887837 + ... + 1261890452.
It is an arithmetic number, because the mean of its divisors is an integer number (323884880550).
Almost surely, 23301102002012 is an apocalyptic number.
It is an amenable number.
3301102002012 is an abundant number, since it is smaller than the sum of its proper divisors (4472135131188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3301102002012 is a wasteful number, since it uses less digits than its factorization.
3301102002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2523778405 (or 2523778403 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 3301102002012 its reverse (2102002011033), we get a palindrome (5403104013045).
The spelling of 3301102002012 in words is "three trillion, three hundred one billion, one hundred two million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •