Base | Representation |
---|---|
bin | 1100101010101… |
… | …01100000101011 |
3 | 21101221101102020 |
4 | 12111111200223 |
5 | 204200201202 |
6 | 14313235523 |
7 | 2430110334 |
oct | 625254053 |
9 | 241841366 |
10 | 106256427 |
11 | 54a85032 |
12 | 2b702ba3 |
13 | 19024434 |
14 | 1017d28b |
15 | 94dd5bc |
hex | 655582b |
106256427 has 8 divisors (see below), whose sum is σ = 142494864. Its totient is φ = 70427808.
The previous prime is 106256401. The next prime is 106256429. The reversal of 106256427 is 724652601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-106256427 is a prime.
It is a super-2 number, since 2×1062564272 = 22580856557612658, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (106256429) 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 7 ways as a sum of consecutive naturals, for example, 101848 + ... + 102885.
It is an arithmetic number, because the mean of its divisors is an integer number (17811858).
Almost surely, 2106256427 is an apocalyptic number.
106256427 is a deficient number, since it is larger than the sum of its proper divisors (36238437).
106256427 is a wasteful number, since it uses less digits than its factorization.
106256427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204909.
The product of its (nonzero) digits is 20160, while the sum is 33.
The square root of 106256427 is about 10308.0758146222. The cubic root of 106256427 is about 473.6436683501.
The spelling of 106256427 in words is "one hundred six million, two hundred fifty-six thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •