Base | Representation |
---|---|
bin | 1100101000111… |
… | …01000000101000 |
3 | 21101111121221212 |
4 | 12110131000220 |
5 | 204120300000 |
6 | 14304252252 |
7 | 2425124534 |
oct | 624350050 |
9 | 241447855 |
10 | 106025000 |
11 | 54937174 |
12 | 2b611088 |
13 | 18c72cb3 |
14 | 1011cbc4 |
15 | 9494c35 |
hex | 651d028 |
106025000 has 48 divisors (see below), whose sum is σ = 248538780. Its totient is φ = 42400000.
The previous prime is 106024999. The next prime is 106025027. The reversal of 106025000 is 520601.
It can be written as a sum of positive squares in 6 ways, for example, as 58564 + 105966436 = 242^2 + 10294^2 .
It is a super-2 number, since 2×1060250002 = 22482601250000000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22880 + ... + 27120.
Almost surely, 2106025000 is an apocalyptic number.
106025000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106025000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124269390).
106025000 is an abundant number, since it is smaller than the sum of its proper divisors (142513780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106025000 is an frugal number, since it uses more digits than its factorization.
106025000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4272 (or 4248 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 106025000 is about 10296.8441767369. The cubic root of 106025000 is about 473.2995523512.
Adding to 106025000 its reverse (520601), we get a palindrome (106545601).
The spelling of 106025000 in words is "one hundred six million, twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •