Base | Representation |
---|---|
bin | 1100101010010… |
… | …11010100110010 |
3 | 21101212021012000 |
4 | 12111023110302 |
5 | 204142332311 |
6 | 14312314430 |
7 | 2426544603 |
oct | 625132462 |
9 | 241767160 |
10 | 106214706 |
11 | 54a56754 |
12 | 2b6a2a16 |
13 | 1900b450 |
14 | 1016bdaa |
15 | 94d1056 |
hex | 654b532 |
106214706 has 32 divisors (see below), whose sum is σ = 254190720. Its totient is φ = 32681232.
The previous prime is 106214701. The next prime is 106214729. The reversal of 106214706 is 607412601.
It is a super-2 number, since 2×1062147062 = 22563127541332872, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 106214706.
It is not an unprimeable number, because it can be changed into a prime (106214701) 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, 74950 + ... + 76353.
It is an arithmetic number, because the mean of its divisors is an integer number (7943460).
Almost surely, 2106214706 is an apocalyptic number.
106214706 is an abundant number, since it is smaller than the sum of its proper divisors (147976014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106214706 is a wasteful number, since it uses less digits than its factorization.
106214706 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151327 (or 151321 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 106214706 is about 10306.0519113771. The cubic root of 106214706 is about 473.5816690436.
The spelling of 106214706 in words is "one hundred six million, two hundred fourteen thousand, seven hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •