Base | Representation |
---|---|
bin | 1010011000000000… |
… | …10111000001010000 |
3 | 112101012011220220010 |
4 | 11030000113001100 |
5 | 42401423130000 |
6 | 2320415114520 |
7 | 255014216031 |
oct | 51400270120 |
9 | 15335156803 |
10 | 5570130000 |
11 | 23a9214126 |
12 | 10b5512a40 |
13 | 6a9cc9716 |
14 | 3abab0a88 |
15 | 229023d50 |
hex | 14c017050 |
5570130000 has 200 divisors, whose sum is σ = 18205897248. Its totient is φ = 1466816000.
The previous prime is 5570129977. The next prime is 5570130031. The reversal of 5570130000 is 310755.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (200).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2488882 + ... + 2491118.
Almost surely, 25570130000 is an apocalyptic number.
5570130000 is a gapful number since it is divisible by the number (50) 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 5570130000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9102948624).
5570130000 is an abundant number, since it is smaller than the sum of its proper divisors (12635767248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5570130000 is a wasteful number, since it uses less digits than its factorization.
5570130000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2351 (or 2330 counting only the distinct ones).
The product of its (nonzero) digits is 525, while the sum is 21.
The square root of 5570130000 is about 74633.3035581301. The cubic root of 5570130000 is about 1772.6450287587.
Adding to 5570130000 its reverse (310755), we get a palindrome (5570440755).
The spelling of 5570130000 in words is "five billion, five hundred seventy million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •