Base | Representation |
---|---|
bin | 1100101010101… |
… | …00001101011101 |
3 | 21101221010002222 |
4 | 12111110031131 |
5 | 204200013401 |
6 | 14313155125 |
7 | 2430055655 |
oct | 625241535 |
9 | 241833088 |
10 | 106251101 |
11 | 54a81030 |
12 | 2b6bbaa5 |
13 | 19021b98 |
14 | 1017b365 |
15 | 94dbc1b |
hex | 655435d |
106251101 has 8 divisors (see below), whose sum is σ = 116108544. Its totient is φ = 96426720.
The previous prime is 106251073. The next prime is 106251113. The reversal of 106251101 is 101152601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106251101 is a prime.
It is a super-2 number, since 2×1062511012 = 22578592927424402, which 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 106251101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106251001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1280 + ... + 14633.
It is an arithmetic number, because the mean of its divisors is an integer number (14513568).
Almost surely, 2106251101 is an apocalyptic number.
106251101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106251101 is a deficient number, since it is larger than the sum of its proper divisors (9857443).
106251101 is a wasteful number, since it uses less digits than its factorization.
106251101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16531.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 106251101 is about 10307.8174702504. The cubic root of 106251101 is about 473.6357545753.
The spelling of 106251101 in words is "one hundred six million, two hundred fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •