Base | Representation |
---|---|
bin | 111110000011001… |
… | …101101101110000 |
3 | 2200112212210200200 |
4 | 332003031231300 |
5 | 4113000430000 |
6 | 251144515200 |
7 | 34540415613 |
oct | 7603155560 |
9 | 2615783620 |
10 | 1041030000 |
11 | 4946a827a |
12 | 25077bb00 |
13 | 1378a47aa |
14 | 9c38c17a |
15 | 615d8500 |
hex | 3e0cdb70 |
1041030000 has 300 divisors, whose sum is σ = 3739146840. Its totient is φ = 270144000.
The previous prime is 1041029993. The next prime is 1041030019. The reversal of 1041030000 is 301401.
It is a tau number, because it is divible by the number of its divisors (300).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 3869866 + ... + 3870134.
Almost surely, 21041030000 is an apocalyptic number.
1041030000 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 1041030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1869573420).
1041030000 is an abundant number, since it is smaller than the sum of its proper divisors (2698116840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1041030000 is a wasteful number, since it uses less digits than its factorization.
1041030000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346 (or 322 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 1041030000 is about 32264.9965132495. The cubic root of 1041030000 is about 1013.4937659576.
Adding to 1041030000 its reverse (301401), we get a palindrome (1041331401).
The spelling of 1041030000 in words is "one billion, forty-one million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •