Base | Representation |
---|---|
bin | 101000000100001100100… |
… | …1011011101000000011110 |
3 | 201111102102100220010210210 |
4 | 1100020121023131000132 |
5 | 1210204424022200040 |
6 | 15413403352313250 |
7 | 1105556644006461 |
oct | 120103113350036 |
9 | 21442370803723 |
10 | 5506570506270 |
11 | 1833361549629 |
12 | 74b2633a2826 |
13 | 30c36254ac72 |
14 | 15073b4852d8 |
15 | 9838a0d1480 |
hex | 502192dd01e |
5506570506270 has 128 divisors (see below), whose sum is σ = 14091103180800. Its totient is φ = 1373166093312.
The previous prime is 5506570506257. The next prime is 5506570506271. The reversal of 5506570506270 is 726050756055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5506570506271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 200684992 + ... + 200712428.
It is an arithmetic number, because the mean of its divisors is an integer number (110086743600).
Almost surely, 25506570506270 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5506570506270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7045551590400).
5506570506270 is an abundant number, since it is smaller than the sum of its proper divisors (8584532674530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5506570506270 is a wasteful number, since it uses less digits than its factorization.
5506570506270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32002.
The product of its (nonzero) digits is 2205000, while the sum is 48.
The spelling of 5506570506270 in words is "five trillion, five hundred six billion, five hundred seventy million, five hundred six thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •