Base | Representation |
---|---|
bin | 11000001101010010101000… |
… | …000010110100111011110111 |
3 | 111221222002120020220112221102 |
4 | 120031102220002310323313 |
5 | 102423321311433143042 |
6 | 1014234004231440315 |
7 | 31265643225551324 |
oct | 3015225002647367 |
9 | 457862506815842 |
10 | 106466468646647 |
11 | 30a181a2a80a4a |
12 | bb35ab8b2609b |
13 | 475398b765105 |
14 | 1c4100c7b9b4b |
15 | c4968570eb32 |
hex | 60d4a80b4ef7 |
106466468646647 has 16 divisors (see below), whose sum is σ = 110143723398144. Its totient is φ = 102867861600000.
The previous prime is 106466468646589. The next prime is 106466468646691. The reversal of 106466468646647 is 746646864664601.
It is a cyclic number.
It is not a de Polignac number, because 106466468646647 - 228 = 106466200211191 is a prime.
It is a super-2 number, since 2×1064664686466472 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106466468616647) by changing a digit.
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, 67251854 + ... + 68816747.
It is an arithmetic number, because the mean of its divisors is an integer number (6883982712384).
Almost surely, 2106466468646647 is an apocalyptic number.
106466468646647 is a deficient number, since it is larger than the sum of its proper divisors (3677254751497).
106466468646647 is a wasteful number, since it uses less digits than its factorization.
106466468646647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136068890.
The product of its (nonzero) digits is 4013162496, while the sum is 74.
The spelling of 106466468646647 in words is "one hundred six trillion, four hundred sixty-six billion, four hundred sixty-eight million, six hundred forty-six thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •