Base | Representation |
---|---|
bin | 1100101011000… |
… | …11100000100111 |
3 | 21102001022001221 |
4 | 12111203200213 |
5 | 204204020032 |
6 | 14314401211 |
7 | 2430436450 |
oct | 625434047 |
9 | 242038057 |
10 | 106313767 |
11 | 5501411a |
12 | 2b730207 |
13 | 19044571 |
14 | 10196127 |
15 | 9500597 |
hex | 6563827 |
106313767 has 16 divisors (see below), whose sum is σ = 130470912. Its totient is φ = 84551040.
The previous prime is 106313749. The next prime is 106313777. The reversal of 106313767 is 767313601.
It is a happy number.
It is not a de Polignac number, because 106313767 - 27 = 106313639 is a prime.
It is a super-2 number, since 2×1063137672 = 22605234107460578, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106313717) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2158 + ... + 14740.
It is an arithmetic number, because the mean of its divisors is an integer number (8154432).
Almost surely, 2106313767 is an apocalyptic number.
106313767 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
106313767 is a deficient number, since it is larger than the sum of its proper divisors (24157145).
106313767 is a wasteful number, since it uses less digits than its factorization.
106313767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12678.
The product of its (nonzero) digits is 15876, while the sum is 34.
The square root of 106313767 is about 10310.8567539269. The cubic root of 106313767 is about 473.7288517280.
The spelling of 106313767 in words is "one hundred six million, three hundred thirteen thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •