Base | Representation |
---|---|
bin | 1001011100011101… |
… | …00111110011000100 |
3 | 111002101010202001212 |
4 | 10232032213303010 |
5 | 40341030133020 |
6 | 2155051310552 |
7 | 236436661124 |
oct | 45616476304 |
9 | 14071122055 |
10 | 5070552260 |
11 | 2172215a64 |
12 | b9614b458 |
13 | 62a6618a7 |
14 | 3615c8c84 |
15 | 1ea240cc5 |
hex | 12e3a7cc4 |
5070552260 has 96 divisors (see below), whose sum is σ = 11697219072. Its totient is φ = 1838592000.
The previous prime is 5070552257. The next prime is 5070552271. The reversal of 5070552260 is 622550705.
It is a super-2 number, since 2×50705522602 = 51421000442782215200, which contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1064885 + ... + 1069635.
It is an arithmetic number, because the mean of its divisors is an integer number (121846032).
Almost surely, 25070552260 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 5070552260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5848609536).
5070552260 is an abundant number, since it is smaller than the sum of its proper divisors (6626666812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5070552260 is a wasteful number, since it uses less digits than its factorization.
5070552260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4893 (or 4891 counting only the distinct ones).
The product of its (nonzero) digits is 21000, while the sum is 32.
The square root of 5070552260 is about 71207.8103862210. The cubic root of 5070552260 is about 1717.9812555806.
The spelling of 5070552260 in words is "five billion, seventy million, five hundred fifty-two thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •