Base | Representation |
---|---|
bin | 1100101001010… |
… | …00110000001100 |
3 | 21101121001221100 |
4 | 12110220300030 |
5 | 204123314400 |
6 | 14305303100 |
7 | 2425415010 |
oct | 624506014 |
9 | 241531840 |
10 | 106073100 |
11 | 5496a321 |
12 | 2b634a90 |
13 | 18c8bb63 |
14 | 10132540 |
15 | 94a4100 |
hex | 6528c0c |
106073100 has 216 divisors, whose sum is σ = 385912800. Its totient is φ = 23869440.
The previous prime is 106073057. The next prime is 106073101. The reversal of 106073100 is 1370601.
It is a super-2 number, since 2×1060731002 = 22503005087220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (106073101) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 711826 + ... + 711974.
Almost surely, 2106073100 is an apocalyptic number.
106073100 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 106073100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192956400).
106073100 is an abundant number, since it is smaller than the sum of its proper divisors (279839700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106073100 is a wasteful number, since it uses less digits than its factorization.
106073100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289 (or 279 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 18.
The square root of 106073100 is about 10299.1795789762. The cubic root of 106073100 is about 473.3711149282.
The spelling of 106073100 in words is "one hundred six million, seventy-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •