Base | Representation |
---|---|
bin | 1100101011110… |
… | …11101010011011 |
3 | 21102020022210002 |
4 | 12111323222123 |
5 | 204220201244 |
6 | 14320443215 |
7 | 2431331051 |
oct | 625735233 |
9 | 242208702 |
10 | 106412699 |
11 | 55081488 |
12 | 2b77950b |
13 | 1907a5c3 |
14 | 101c01d1 |
15 | 951ea4e |
hex | 657ba9b |
106412699 has 8 divisors (see below), whose sum is σ = 107657472. Its totient is φ = 105172200.
The previous prime is 106412681. The next prime is 106412717. The reversal of 106412699 is 996214601.
It is an interprime number because it is at equal distance from previous prime (106412681) and next prime (106412717).
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-106412699 is a prime.
It is a super-2 number, since 2×1064126992 = 22647325016929202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106412399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100724 + ... + 101774.
It is an arithmetic number, because the mean of its divisors is an integer number (13457184).
Almost surely, 2106412699 is an apocalyptic number.
106412699 is a deficient number, since it is larger than the sum of its proper divisors (1244773).
106412699 is a wasteful number, since it uses less digits than its factorization.
106412699 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2137.
The product of its (nonzero) digits is 23328, while the sum is 38.
The square root of 106412699 is about 10315.6531058387. The cubic root of 106412699 is about 473.8757515259.
The spelling of 106412699 in words is "one hundred six million, four hundred twelve thousand, six hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •