Base | Representation |
---|---|
bin | 100110010010000110111… |
… | …0011010000011011110110 |
3 | 200122000000121120221121010 |
4 | 1030210031303100123312 |
5 | 1142201142004244240 |
6 | 15105044045533050 |
7 | 1052064344066250 |
oct | 114441563203366 |
9 | 20560017527533 |
10 | 5261566478070 |
11 | 17494661209a1 |
12 | 70b887b74186 |
13 | 2c221853a306 |
14 | 1429383a6cd0 |
15 | 91ceabc5280 |
hex | 4c90dcd06f6 |
5261566478070 has 256 divisors, whose sum is σ = 15140556288000. Its totient is φ = 1144847112192.
The previous prime is 5261566478017. The next prime is 5261566478071. The reversal of 5261566478070 is 708746651625.
It is a self number, because there is not a number n which added to its sum of digits gives 5261566478070.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5261566478071) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 143626516 + ... + 143663144.
It is an arithmetic number, because the mean of its divisors is an integer number (59142798000).
Almost surely, 25261566478070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5261566478070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7570278144000).
5261566478070 is an abundant number, since it is smaller than the sum of its proper divisors (9878989809930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5261566478070 is a wasteful number, since it uses less digits than its factorization.
5261566478070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37007.
The product of its (nonzero) digits is 16934400, while the sum is 57.
The spelling of 5261566478070 in words is "five trillion, two hundred sixty-one billion, five hundred sixty-six million, four hundred seventy-eight thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •