Base | Representation |
---|---|
bin | 1001010010000101110110… |
… | …0110011110101101110000 |
3 | 1100010201112110002000010102 |
4 | 2110201131212132231300 |
5 | 2314210213120214124 |
6 | 33412432232451532 |
7 | 2102250264133610 |
oct | 224413546365560 |
9 | 40121473060112 |
10 | 10206412663664 |
11 | 3285573960358 |
12 | 118a0a2b49ba8 |
13 | 5905cab99b29 |
14 | 273dc8b5ca40 |
15 | 12a75b365aae |
hex | 9485d99eb70 |
10206412663664 has 80 divisors (see below), whose sum is σ = 22714379633088. Its totient is φ = 4352061997056.
The previous prime is 10206412663661. The next prime is 10206412663771. The reversal of 10206412663664 is 46636621460201.
10206412663664 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102064126636642 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206412663661) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24461012 + ... + 24874764.
Almost surely, 210206412663664 is an apocalyptic number.
10206412663664 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10206412663664 is an abundant number, since it is smaller than the sum of its proper divisors (12507966969424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206412663664 is a wasteful number, since it uses less digits than its factorization.
10206412663664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414882 (or 414876 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 47.
The spelling of 10206412663664 in words is "ten trillion, two hundred six billion, four hundred twelve million, six hundred sixty-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •