Base | Representation |
---|---|
bin | 11000001010101010110101… |
… | …010100110000110010000111 |
3 | 111221022212112012010112222202 |
4 | 120022222311110300302013 |
5 | 102412343322010404412 |
6 | 1014015130424545115 |
7 | 31246634444416052 |
oct | 3012526524606207 |
9 | 457285465115882 |
10 | 106286302825607 |
11 | 3095884a080a93 |
12 | bb06bb792219b |
13 | 473c9a8672708 |
14 | 1c363da977a99 |
15 | c44b3d69e3c2 |
hex | 60aab5530c87 |
106286302825607 has 4 divisors (see below), whose sum is σ = 106288699026216. Its totient is φ = 106283906625000.
The previous prime is 106286302825583. The next prime is 106286302825613. The reversal of 106286302825607 is 706528203682601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106286302825607 is a prime.
It is a super-2 number, since 2×1062863028256072 (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 (106786302825607) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1198033769 + ... + 1198122482.
It is an arithmetic number, because the mean of its divisors is an integer number (26572174756554).
Almost surely, 2106286302825607 is an apocalyptic number.
106286302825607 is a deficient number, since it is larger than the sum of its proper divisors (2396200609).
106286302825607 is an equidigital number, since it uses as much as digits as its factorization.
106286302825607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2396200608.
The product of its (nonzero) digits is 11612160, while the sum is 56.
The spelling of 106286302825607 in words is "one hundred six trillion, two hundred eighty-six billion, three hundred two million, eight hundred twenty-five thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •