Base | Representation |
---|---|
bin | 11000001110100101101011… |
… | …101110100100000111000001 |
3 | 111222021121202112021021110001 |
4 | 120032211223232210013001 |
5 | 102431301433124440410 |
6 | 1014342553523240001 |
7 | 31305251236305415 |
oct | 3016455356440701 |
9 | 458247675237401 |
10 | 106555651015105 |
11 | 30a51aa8109396 |
12 | bb4b247b19001 |
13 | 475c202070136 |
14 | 1c4546cc7cd45 |
15 | c4bb54dd033a |
hex | 60e96bba41c1 |
106555651015105 has 4 divisors (see below), whose sum is σ = 127866781218132. Its totient is φ = 85244520812080.
The previous prime is 106555651015069. The next prime is 106555651015123. The reversal of 106555651015105 is 501510156555601.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22080563408016 + 84475087607089 = 4698996^2 + 9191033^2 .
It is not a de Polignac number, because 106555651015105 - 211 = 106555651013057 is a prime.
It is a super-2 number, since 2×1065556510151052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10655565101506 + ... + 10655565101515.
It is an arithmetic number, because the mean of its divisors is an integer number (31966695304533).
Almost surely, 2106555651015105 is an apocalyptic number.
It is an amenable number.
106555651015105 is a deficient number, since it is larger than the sum of its proper divisors (21311130203027).
106555651015105 is an equidigital number, since it uses as much as digits as its factorization.
106555651015105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21311130203026.
The product of its (nonzero) digits is 562500, while the sum is 46.
The spelling of 106555651015105 in words is "one hundred six trillion, five hundred fifty-five billion, six hundred fifty-one million, fifteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •