Base | Representation |
---|---|
bin | 1100101001100… |
… | …10001000101111 |
3 | 21101200000122212 |
4 | 12110302020233 |
5 | 204131032120 |
6 | 14310201035 |
7 | 2425635035 |
oct | 624621057 |
9 | 241600585 |
10 | 106111535 |
11 | 54996192 |
12 | 2b65317b |
13 | 18ca34ba |
14 | 10142555 |
15 | 94b06c5 |
hex | 653222f |
106111535 has 16 divisors (see below), whose sum is σ = 140688576. Its totient is φ = 76420608.
The previous prime is 106111531. The next prime is 106111541. The reversal of 106111535 is 535111601.
It is a cyclic number.
It is not a de Polignac number, because 106111535 - 22 = 106111531 is a prime.
It is a super-2 number, since 2×1061115352 = 22519315720112450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106111535.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106111531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25184 + ... + 29093.
It is an arithmetic number, because the mean of its divisors is an integer number (8793036).
Almost surely, 2106111535 is an apocalyptic number.
106111535 is a deficient number, since it is larger than the sum of its proper divisors (34577041).
106111535 is a wasteful number, since it uses less digits than its factorization.
106111535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54322.
The product of its (nonzero) digits is 450, while the sum is 23.
The square root of 106111535 is about 10301.0453353046. The cubic root of 106111535 is about 473.4282824907.
The spelling of 106111535 in words is "one hundred six million, one hundred eleven thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •