Base | Representation |
---|---|
bin | 1100101001111… |
… | …00111111111101 |
3 | 21101202021200210 |
4 | 12110330333331 |
5 | 204133443104 |
6 | 14311143033 |
7 | 2426211540 |
oct | 624747775 |
9 | 241667623 |
10 | 106156029 |
11 | 54a16661 |
12 | 2b674a79 |
13 | 18cba825 |
14 | 10154857 |
15 | 94bd989 |
hex | 653cffd |
106156029 has 16 divisors (see below), whose sum is σ = 161943552. Its totient is φ = 60592368.
The previous prime is 106156027. The next prime is 106156031. The reversal of 106156029 is 920651601.
It is an interprime number because it is at equal distance from previous prime (106156027) and next prime (106156031).
It is not a de Polignac number, because 106156029 - 21 = 106156027 is a prime.
It is a super-2 number, since 2×1061560292 = 22538204986097682, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106155987 and 106156005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106156027) 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 15 ways as a sum of consecutive naturals, for example, 20872 + ... + 25454.
It is an arithmetic number, because the mean of its divisors is an integer number (10121472).
Almost surely, 2106156029 is an apocalyptic number.
It is an amenable number.
106156029 is a deficient number, since it is larger than the sum of its proper divisors (55787523).
106156029 is a wasteful number, since it uses less digits than its factorization.
106156029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5696.
The product of its (nonzero) digits is 3240, while the sum is 30.
The square root of 106156029 is about 10303.2047926847. The cubic root of 106156029 is about 473.4944448687.
The spelling of 106156029 in words is "one hundred six million, one hundred fifty-six thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •