Base | Representation |
---|---|
bin | 1010010001101011… |
… | …11111100111110000 |
3 | 112020111100202110000 |
4 | 11020311333213300 |
5 | 42244333043242 |
6 | 2311242110000 |
7 | 253501262316 |
oct | 51065774760 |
9 | 15214322400 |
10 | 5517081072 |
11 | 2381280738 |
12 | 109b7ab300 |
13 | 69c014619 |
14 | 3a4a220b6 |
15 | 224545a4c |
hex | 148d7f9f0 |
5517081072 has 200 divisors, whose sum is σ = 17088655760. Its totient is φ = 1713208320.
The previous prime is 5517081071. The next prime is 5517081079. The reversal of 5517081072 is 2701807155.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5517081071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1500228 + ... + 1503900.
Almost surely, 25517081072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5517081072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8544327880).
5517081072 is an abundant number, since it is smaller than the sum of its proper divisors (11571574688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5517081072 is a wasteful number, since it uses less digits than its factorization.
5517081072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3773 (or 3758 counting only the distinct ones).
The product of its (nonzero) digits is 19600, while the sum is 36.
The square root of 5517081072 is about 74277.0561613746. The cubic root of 5517081072 is about 1766.9996166273. Note that the first 3 decimals are identical.
The spelling of 5517081072 in words is "five billion, five hundred seventeen million, eighty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •