Base | Representation |
---|---|
bin | 1100101100001… |
… | …10100001110101 |
3 | 21102022120211110 |
4 | 12112012201311 |
5 | 204223112310 |
6 | 14321425233 |
7 | 2431604601 |
oct | 626064165 |
9 | 242276743 |
10 | 106457205 |
11 | 55101968 |
12 | 2b79b219 |
13 | 1909493a |
14 | 101d2501 |
15 | 952cd20 |
hex | 6586875 |
106457205 has 8 divisors (see below), whose sum is σ = 170331552. Its totient is φ = 56777168.
The previous prime is 106457203. The next prime is 106457227. The reversal of 106457205 is 502754601.
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 106457205 - 21 = 106457203 is a prime.
It is a super-2 number, since 2×1064572052 = 22666272992824050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106457203) 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, 3548559 + ... + 3548588.
It is an arithmetic number, because the mean of its divisors is an integer number (21291444).
Almost surely, 2106457205 is an apocalyptic number.
106457205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106457205 is a deficient number, since it is larger than the sum of its proper divisors (63874347).
106457205 is an equidigital number, since it uses as much as digits as its factorization.
106457205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7097155.
The product of its (nonzero) digits is 8400, while the sum is 30.
The square root of 106457205 is about 10317.8100874168. The cubic root of 106457205 is about 473.9418068458.
The spelling of 106457205 in words is "one hundred six million, four hundred fifty-seven thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •