Base | Representation |
---|---|
bin | 110101010011101000011… |
… | …110101110111000111000 |
3 | 110222012101120121101101110 |
4 | 311103220132232320320 |
5 | 440004224400203210 |
6 | 11442505005120320 |
7 | 525441551356356 |
oct | 65235036567070 |
9 | 13865346541343 |
10 | 3663212506680 |
11 | 1192617a62131 |
12 | 4b1b565590a0 |
13 | 2075936448cc |
14 | c942c5527d6 |
15 | 6544dd83420 |
hex | 354e87aee38 |
3663212506680 has 64 divisors (see below), whose sum is σ = 11057058668160. Its totient is φ = 970863677568.
The previous prime is 3663212506663. The next prime is 3663212506697. The reversal of 3663212506680 is 866052123663.
It is an interprime number because it is at equal distance from previous prime (3663212506663) and next prime (3663212506697).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93620842 + ... + 93659961.
It is an arithmetic number, because the mean of its divisors is an integer number (172766541690).
Almost surely, 23663212506680 is an apocalyptic number.
3663212506680 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3663212506680 is an abundant number, since it is smaller than the sum of its proper divisors (7393846161480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3663212506680 is a wasteful number, since it uses less digits than its factorization.
3663212506680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187280980 (or 187280976 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 48.
The spelling of 3663212506680 in words is "three trillion, six hundred sixty-three billion, two hundred twelve million, five hundred six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •