Base | Representation |
---|---|
bin | 110001100110010001… |
… | …1110110011010101101 |
3 | 101011220221112210121201 |
4 | 1203030203312122231 |
5 | 3221113324240401 |
6 | 120532555525501 |
7 | 10460305652065 |
oct | 1431443663255 |
9 | 334827483551 |
10 | 106511165101 |
11 | 41197859890 |
12 | 18786459891 |
13 | a07576c563 |
14 | 5225ad03a5 |
15 | 2b85b93b01 |
hex | 18cc8f66ad |
106511165101 has 16 divisors (see below), whose sum is σ = 123044436288. Its totient is φ = 91121068800.
The previous prime is 106511165093. The next prime is 106511165183. The reversal of 106511165101 is 101561115601.
It is a cyclic number.
It is not a de Polignac number, because 106511165101 - 23 = 106511165093 is a prime.
It is a super-2 number, since 2×1065111651012 (a number of 23 digits) contains 22 as substring.
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 106511165101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106511165191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1668691 + ... + 1731343.
It is an arithmetic number, because the mean of its divisors is an integer number (7690277268).
Almost surely, 2106511165101 is an apocalyptic number.
106511165101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106511165101 is a deficient number, since it is larger than the sum of its proper divisors (16533271187).
106511165101 is a wasteful number, since it uses less digits than its factorization.
106511165101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71772.
The product of its (nonzero) digits is 900, while the sum is 28.
The spelling of 106511165101 in words is "one hundred six billion, five hundred eleven million, one hundred sixty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •