Base | Representation |
---|---|
bin | 1100101010110… |
… | …01101110100100 |
3 | 21101222021002222 |
4 | 12111121232210 |
5 | 204201224300 |
6 | 14313451512 |
7 | 2430211601 |
oct | 625315644 |
9 | 241867088 |
10 | 106273700 |
11 | 54a97005 |
12 | 2b710b98 |
13 | 1902c260 |
14 | 101856a8 |
15 | 94e3785 |
hex | 6559ba4 |
106273700 has 36 divisors (see below), whose sum is σ = 248356500. Its totient is φ = 39239040.
The previous prime is 106273679. The next prime is 106273709. The reversal of 106273700 is 7372601.
It can be written as a sum of positive squares in 6 ways, for example, as 38738176 + 67535524 = 6224^2 + 8218^2 .
It is a super-2 number, since 2×1062737002 = 22588198623380000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 106273700.
It is not an unprimeable number, because it can be changed into a prime (106273709) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39575 + ... + 42174.
Almost surely, 2106273700 is an apocalyptic number.
106273700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106273700 is an abundant number, since it is smaller than the sum of its proper divisors (142082800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106273700 is a wasteful number, since it uses less digits than its factorization.
106273700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81776 (or 81769 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 26.
The square root of 106273700 is about 10308.9136188058. The cubic root of 106273700 is about 473.6693320646.
The spelling of 106273700 in words is "one hundred six million, two hundred seventy-three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •