Base | Representation |
---|---|
bin | 100100011101100000011… |
… | …0011011001001011101100 |
3 | 122202001200210222102000101 |
4 | 1020323000303121023230 |
5 | 1124100332120040400 |
6 | 14354033110440444 |
7 | 1025021243666413 |
oct | 110730063311354 |
9 | 18661623872011 |
10 | 5011166565100 |
11 | 1662250981163 |
12 | 68b245663124 |
13 | 2a472166a637 |
14 | 13478281447a |
15 | 8a542c1356a |
hex | 48ec0cd92ec |
5011166565100 has 72 divisors (see below), whose sum is σ = 10888173893520. Its totient is φ = 2001898168320.
The previous prime is 5011166565047. The next prime is 5011166565101. The reversal of 5011166565100 is 15656611105.
It is a super-2 number, since 2×50111665651002 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5011166565100.
It is not an unprimeable number, because it can be changed into a prime (5011166565101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 315377956 + ... + 315393844.
It is an arithmetic number, because the mean of its divisors is an integer number (151224637410).
Almost surely, 25011166565100 is an apocalyptic number.
5011166565100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5011166565100 is an abundant number, since it is smaller than the sum of its proper divisors (5877007328420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5011166565100 is a wasteful number, since it uses less digits than its factorization.
5011166565100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19747 (or 19740 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 5011166565100 in words is "five trillion, eleven billion, one hundred sixty-six million, five hundred sixty-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •