Base | Representation |
---|---|
bin | 110001011010011110… |
… | …1000000011100011111 |
3 | 101010220100021221111000 |
4 | 1202310331000130133 |
5 | 3214310431402331 |
6 | 120425411001343 |
7 | 10444426344414 |
oct | 1426475003437 |
9 | 333810257430 |
10 | 106115106591 |
11 | 410042361aa |
12 | 18695899253 |
13 | a0116ab000 |
14 | 51c927410b |
15 | 2b6100d0e6 |
hex | 18b4f4071f |
106115106591 has 64 divisors (see below), whose sum is σ = 170886284800. Its totient is φ = 65077725024.
The previous prime is 106115106541. The next prime is 106115106607. The reversal of 106115106591 is 195601511601.
It is a happy number.
106115106591 is a `hidden beast` number, since 1 + 0 + 6 + 11 + 51 + 0 + 6 + 591 = 666.
It is not a de Polignac number, because 106115106591 - 210 = 106115105567 is a prime.
It is a super-2 number, since 2×1061151065912 (a number of 23 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 (106115106541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18208020 + ... + 18213846.
It is an arithmetic number, because the mean of its divisors is an integer number (2670098200).
Almost surely, 2106115106591 is an apocalyptic number.
106115106591 is a deficient number, since it is larger than the sum of its proper divisors (64771178209).
106115106591 is an equidigital number, since it uses as much as digits as its factorization.
106115106591 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6182 (or 6150 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 36.
The spelling of 106115106591 in words is "one hundred six billion, one hundred fifteen million, one hundred six thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •