Base | Representation |
---|---|
bin | 1100101001000… |
… | …10011101000100 |
3 | 21101112202112210 |
4 | 12110202131010 |
5 | 204122003200 |
6 | 14304543420 |
7 | 2425246542 |
oct | 624423504 |
9 | 241482483 |
10 | 106047300 |
11 | 549519a7 |
12 | 2b621b70 |
13 | 18c801a8 |
14 | 10126d92 |
15 | 949b650 |
hex | 6522744 |
106047300 has 72 divisors (see below), whose sum is σ = 308994112. Its totient is φ = 28080000.
The previous prime is 106047289. The next prime is 106047313. The reversal of 106047300 is 3740601.
It is a super-2 number, since 2×1060473002 = 22492059674580000, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44130 + ... + 46470.
Almost surely, 2106047300 is an apocalyptic number.
106047300 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 106047300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154497056).
106047300 is an abundant number, since it is smaller than the sum of its proper divisors (202946812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106047300 is a wasteful number, since it uses less digits than its factorization.
106047300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2509 (or 2502 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 106047300 is about 10297.9269758530. The cubic root of 106047300 is about 473.3327327022.
Adding to 106047300 its reverse (3740601), we get a palindrome (109787901).
The spelling of 106047300 in words is "one hundred six million, forty-seven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •