Base | Representation |
---|---|
bin | 1010010010001110… |
… | …10110010000110100 |
3 | 112020210220212202110 |
4 | 11021013112100310 |
5 | 42302014132020 |
6 | 2311523411020 |
7 | 253555040256 |
oct | 51107262064 |
9 | 15223825673 |
10 | 5521630260 |
11 | 23838a85a3 |
12 | 10a1223a70 |
13 | 69cc48153 |
14 | 3a5487cd6 |
15 | 224b438e0 |
hex | 1491d6434 |
5521630260 has 96 divisors (see below), whose sum is σ = 16453704960. Its totient is φ = 1378736128.
The previous prime is 5521630237. The next prime is 5521630267. The reversal of 5521630260 is 620361255.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5521630267) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 187201 + ... + 214679.
It is an arithmetic number, because the mean of its divisors is an integer number (171392760).
Almost surely, 25521630260 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 5521630260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8226852480).
5521630260 is an abundant number, since it is smaller than the sum of its proper divisors (10932074700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5521630260 is a wasteful number, since it uses less digits than its factorization.
5521630260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27705 (or 27703 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The square root of 5521630260 is about 74307.6729550859. The cubic root of 5521630260 is about 1767.4851514577.
The spelling of 5521630260 in words is "five billion, five hundred twenty-one million, six hundred thirty thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •