Base | Representation |
---|---|
bin | 11000001011100011111110… |
… | …101101110000000100011111 |
3 | 111221112201220112100122222222 |
4 | 120023203332231300010133 |
5 | 102414400003343431244 |
6 | 1014103235304255555 |
7 | 31254236150025011 |
oct | 3013437655600437 |
9 | 457481815318888 |
10 | 106347663655199 |
11 | 309818777234aa |
12 | bb16a814715bb |
13 | 47457070152c5 |
14 | 1c3937c0641b1 |
15 | c4653060abee |
hex | 60b8feb7011f |
106347663655199 has 4 divisors (see below), whose sum is σ = 109778233450560. Its totient is φ = 102917093859840.
The previous prime is 106347663655099. The next prime is 106347663655267. The reversal of 106347663655199 is 991556366743601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106347663655199 - 228 = 106347395219743 is a prime.
It is a super-2 number, since 2×1063476636551992 (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 (106347663655099) 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, 1715284897634 + ... + 1715284897695.
It is an arithmetic number, because the mean of its divisors is an integer number (27444558362640).
Almost surely, 2106347663655199 is an apocalyptic number.
106347663655199 is a deficient number, since it is larger than the sum of its proper divisors (3430569795361).
106347663655199 is an equidigital number, since it uses as much as digits as its factorization.
106347663655199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3430569795360.
The product of its (nonzero) digits is 661348800, while the sum is 71.
The spelling of 106347663655199 in words is "one hundred six trillion, three hundred forty-seven billion, six hundred sixty-three million, six hundred fifty-five thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •