Base | Representation |
---|---|
bin | 1001100001010001… |
… | …11100010110111010 |
3 | 111012012021001001121 |
4 | 10300220330112322 |
5 | 40431404203100 |
6 | 2203054335454 |
7 | 240440561011 |
oct | 46050742672 |
9 | 14165231047 |
10 | 5111006650 |
11 | 2193036a42 |
12 | ba77ba58a |
13 | 635b571b9 |
14 | 366b19a78 |
15 | 1eda8251a |
hex | 130a3c5ba |
5111006650 has 48 divisors (see below), whose sum is σ = 10595482560. Its totient is φ = 1822867200.
The previous prime is 5111006539. The next prime is 5111006657. The reversal of 5111006650 is 566001115.
It is a super-2 number, since 2×51110066502 = 52244777952688445000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (5111006657) 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, 142086 + ... + 174385.
It is an arithmetic number, because the mean of its divisors is an integer number (220739220).
Almost surely, 25111006650 is an apocalyptic number.
5111006650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5111006650 is an abundant number, since it is smaller than the sum of its proper divisors (5484475910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5111006650 is a wasteful number, since it uses less digits than its factorization.
5111006650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316519 (or 316514 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
The square root of 5111006650 is about 71491.3047160282. The cubic root of 5111006650 is about 1722.5380155257.
Adding to 5111006650 its reverse (566001115), we get a palindrome (5677007765).
The spelling of 5111006650 in words is "five billion, one hundred eleven million, six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •