Base | Representation |
---|---|
bin | 1100010010000… |
… | …01110011110000 |
3 | 21011212110120221 |
4 | 12021001303300 |
5 | 202333430000 |
6 | 14120142424 |
7 | 2360512003 |
oct | 611016360 |
9 | 234773527 |
10 | 103030000 |
11 | 53180a67 |
12 | 2a607a14 |
13 | 184649c8 |
14 | d97d53a |
15 | 90a261a |
hex | 6241cf0 |
103030000 has 50 divisors (see below), whose sum is σ = 249470144. Its totient is φ = 41208000.
The previous prime is 103029991. The next prime is 103030033. The reversal of 103030000 is 30301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
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 9 ways as a sum of consecutive naturals, for example, 4849 + ... + 15151.
Almost surely, 2103030000 is an apocalyptic number.
103030000 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 103030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124735072).
103030000 is an abundant number, since it is smaller than the sum of its proper divisors (146440144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103030000 is an equidigital number, since it uses as much as digits as its factorization.
103030000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10331 (or 10310 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 7.
The square root of 103030000 is about 10150.3694514042. The cubic root of 103030000 is about 468.8003205238.
Adding to 103030000 its reverse (30301), we get a palindrome (103060301).
The spelling of 103030000 in words is "one hundred three million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •