Base | Representation |
---|---|
bin | 1100101011110… |
… | …00010110111001 |
3 | 21102012122012200 |
4 | 12111320112321 |
5 | 204214233121 |
6 | 14320300413 |
7 | 2431243431 |
oct | 625702671 |
9 | 242178180 |
10 | 106399161 |
11 | 550722a0 |
12 | 2b771709 |
13 | 190743ab |
14 | 101b92c1 |
15 | 951aa26 |
hex | 65785b9 |
106399161 has 48 divisors (see below), whose sum is σ = 177934848. Its totient is φ = 60652800.
The previous prime is 106399129. The next prime is 106399169. The reversal of 106399161 is 161993601.
106399161 is a `hidden beast` number, since 1 + 0 + 639 + 9 + 16 + 1 = 666.
It is not a de Polignac number, because 106399161 - 25 = 106399129 is a prime.
It is a super-2 number, since 2×1063991612 = 22641562923007842, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106399169) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 113085 + ... + 114021.
It is an arithmetic number, because the mean of its divisors is an integer number (3706976).
Almost surely, 2106399161 is an apocalyptic number.
106399161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106399161 is a deficient number, since it is larger than the sum of its proper divisors (71535687).
106399161 is a wasteful number, since it uses less digits than its factorization.
106399161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022 (or 1019 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 36.
The square root of 106399161 is about 10314.9968977213. The cubic root of 106399161 is about 473.8556549208.
The spelling of 106399161 in words is "one hundred six million, three hundred ninety-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •