Base | Representation |
---|---|
bin | 1100101011111… |
… | …01100010111101 |
3 | 21102020201100210 |
4 | 12111331202331 |
5 | 204220423123 |
6 | 14320543033 |
7 | 2431362411 |
oct | 625754275 |
9 | 242221323 |
10 | 106420413 |
11 | 55087260 |
12 | 2b781a79 |
13 | 19080c78 |
14 | 101c2d41 |
15 | 9521e93 |
hex | 657d8bd |
106420413 has 8 divisors (see below), whose sum is σ = 154793376. Its totient is φ = 64497200.
The previous prime is 106420411. The next prime is 106420429. The reversal of 106420413 is 314024601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106420413 - 21 = 106420411 is a prime.
It is a super-2 number, since 2×1064204132 = 22650608606181138, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106420413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106420411) 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, 1612398 + ... + 1612463.
It is an arithmetic number, because the mean of its divisors is an integer number (19349172).
Almost surely, 2106420413 is an apocalyptic number.
It is an amenable number.
106420413 is a deficient number, since it is larger than the sum of its proper divisors (48372963).
106420413 is a wasteful number, since it uses less digits than its factorization.
106420413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3224875.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 106420413 is about 10316.0269968627. The cubic root of 106420413 is about 473.8872018799.
The spelling of 106420413 in words is "one hundred six million, four hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •