Base | Representation |
---|---|
bin | 111100011011000… |
… | …010010011101100 |
3 | 2121122111022211022 |
4 | 330123002103230 |
5 | 4034003022200 |
6 | 244331313312 |
7 | 34056323525 |
oct | 7433022354 |
9 | 2548438738 |
10 | 1013720300 |
11 | 48024507a |
12 | 2435ab838 |
13 | 1320321c8 |
14 | 988bd84c |
15 | 5dee1885 |
hex | 3c6c24ec |
1013720300 has 72 divisors (see below), whose sum is σ = 2355057600. Its totient is φ = 377593920.
The previous prime is 1013720297. The next prime is 1013720363. The reversal of 1013720300 is 30273101.
1013720300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 107579 + ... + 116621.
Almost surely, 21013720300 is an apocalyptic number.
1013720300 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 1013720300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1177528800).
1013720300 is an abundant number, since it is smaller than the sum of its proper divisors (1341337300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013720300 is a wasteful number, since it uses less digits than its factorization.
1013720300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9135 (or 9128 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 17.
The square root of 1013720300 is about 31838.9745437883. The cubic root of 1013720300 is about 1004.5526750292.
Adding to 1013720300 its reverse (30273101), we get a palindrome (1043993401).
The spelling of 1013720300 in words is "one billion, thirteen million, seven hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •