Base | Representation |
---|---|
bin | 1001011010001000… |
… | …01000011010111001 |
3 | 111001000101122211000 |
4 | 10231010020122321 |
5 | 40321030300311 |
6 | 2153112555213 |
7 | 236112001434 |
oct | 45504103271 |
9 | 14030348730 |
10 | 5051025081 |
11 | 21621989a3 |
12 | b8b6b2b09 |
13 | 6265b574b |
14 | 35cb8481b |
15 | 1e8685056 |
hex | 12d1086b9 |
5051025081 has 16 divisors (see below), whose sum is σ = 7549225920. Its totient is φ = 3337548480.
The previous prime is 5051025079. The next prime is 5051025103. The reversal of 5051025081 is 1805201505.
5051025081 is a `hidden beast` number, since 50 + 5 + 102 + 508 + 1 = 666.
It is not a de Polignac number, because 5051025081 - 21 = 5051025079 is a prime.
It is a super-2 number, since 2×50510250812 = 51025708737782113122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5051025041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 824715 + ... + 830816.
It is an arithmetic number, because the mean of its divisors is an integer number (471826620).
Almost surely, 25051025081 is an apocalyptic number.
It is an amenable number.
5051025081 is a deficient number, since it is larger than the sum of its proper divisors (2498200839).
5051025081 is a wasteful number, since it uses less digits than its factorization.
5051025081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1655653 (or 1655647 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
The square root of 5051025081 is about 71070.5640965372. The cubic root of 5051025081 is about 1715.7730487426.
Adding to 5051025081 its reverse (1805201505), we get a palindrome (6856226586).
The spelling of 5051025081 in words is "five billion, fifty-one million, twenty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •