Base | Representation |
---|---|
bin | 1100001001011… |
… | …11011100010100 |
3 | 21002202101000120 |
4 | 12010233130110 |
5 | 202041444241 |
6 | 14040111540 |
7 | 2345121420 |
oct | 604573424 |
9 | 232671016 |
10 | 101906196 |
11 | 525836a7 |
12 | 2a1655b0 |
13 | 18160332 |
14 | d769b80 |
15 | 8e2e666 |
hex | 612f714 |
101906196 has 96 divisors (see below), whose sum is σ = 290626560. Its totient is φ = 27143424.
The previous prime is 101906183. The next prime is 101906209. The reversal of 101906196 is 691609101.
It is an interprime number because it is at equal distance from previous prime (101906183) and next prime (101906209).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 106456 + ... + 107408.
It is an arithmetic number, because the mean of its divisors is an integer number (3027360).
Almost surely, 2101906196 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101906196, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145313280).
101906196 is an abundant number, since it is smaller than the sum of its proper divisors (188720364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101906196 is a wasteful number, since it uses less digits than its factorization.
101906196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053 (or 1051 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 33.
The square root of 101906196 is about 10094.8598801568. The cubic root of 101906196 is about 467.0895991270.
The spelling of 101906196 in words is "one hundred one million, nine hundred six thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •