Base | Representation |
---|---|
bin | 100100011001101001001… |
… | …0111101101111111000100 |
3 | 122201021021201002121111020 |
4 | 1020303102113231333010 |
5 | 1123431340032144242 |
6 | 14350142023511140 |
7 | 1024305546652263 |
oct | 110632227557704 |
9 | 18637251077436 |
10 | 5002871365572 |
11 | 1659784508a63 |
12 | 68970b5b84b0 |
13 | 2a39cbc1a752 |
14 | 1341d6c665da |
15 | 8a2098566ec |
hex | 48cd25edfc4 |
5002871365572 has 96 divisors (see below), whose sum is σ = 12374762400000. Its totient is φ = 1567659405312.
The previous prime is 5002871365571. The next prime is 5002871365673. The reversal of 5002871365572 is 2755631782005.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (5002871365571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1000771929 + ... + 1000776927.
It is an arithmetic number, because the mean of its divisors is an integer number (128903775000).
Almost surely, 25002871365572 is an apocalyptic number.
It is an amenable number.
5002871365572 is an abundant number, since it is smaller than the sum of its proper divisors (7371891034428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5002871365572 is a wasteful number, since it uses less digits than its factorization.
5002871365572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9885 (or 9883 counting only the distinct ones).
The product of its (nonzero) digits is 3528000, while the sum is 51.
The spelling of 5002871365572 in words is "five trillion, two billion, eight hundred seventy-one million, three hundred sixty-five thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •