Base | Representation |
---|---|
bin | 11000001111111010011101… |
… | …100001111000111010100011 |
3 | 111222121022201112222212001102 |
4 | 120033322131201320322203 |
5 | 102434244400300211332 |
6 | 1014452450413025015 |
7 | 31314653112262160 |
oct | 3017723541707243 |
9 | 458538645885042 |
10 | 106646680866467 |
11 | 30a87670092005 |
12 | bb64a1178516b |
13 | 476797b351a01 |
14 | 1c49a26859067 |
15 | c4e1d1888062 |
hex | 60fe9d878ea3 |
106646680866467 has 24 divisors (see below), whose sum is σ = 123160516651296. Its totient is φ = 90462349836288.
The previous prime is 106646680866457. The next prime is 106646680866469. The reversal of 106646680866467 is 764668086646601.
It is a de Polignac number, because none of the positive numbers 2k-106646680866467 is a prime.
It is a super-2 number, since 2×1066466808664672 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106646680866394 and 106646680866403.
It is not an unprimeable number, because it can be changed into a prime (106646680866469) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1020363203 + ... + 1020467715.
It is an arithmetic number, because the mean of its divisors is an integer number (5131688193804).
Almost surely, 2106646680866467 is an apocalyptic number.
106646680866467 is a deficient number, since it is larger than the sum of its proper divisors (16513835784829).
106646680866467 is an equidigital number, since it uses as much as digits as its factorization.
106646680866467 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120207 (or 120110 counting only the distinct ones).
The product of its (nonzero) digits is 2006581248, while the sum is 74.
The spelling of 106646680866467 in words is "one hundred six trillion, six hundred forty-six billion, six hundred eighty million, eight hundred sixty-six thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •