Base | Representation |
---|---|
bin | 1001011110111001… |
… | …01001001010011001 |
3 | 111010210121212001202 |
4 | 10233130221022121 |
5 | 40411244130311 |
6 | 2201101523545 |
7 | 240105554261 |
oct | 45734511231 |
9 | 14123555052 |
10 | 5091005081 |
11 | 2182815518 |
12 | ba0b735b5 |
13 | 631973156 |
14 | 3641d07a1 |
15 | 1ebe30e3b |
hex | 12f729299 |
5091005081 has 8 divisors (see below), whose sum is σ = 5435897280. Its totient is φ = 4756408272.
The previous prime is 5091005069. The next prime is 5091005089. The reversal of 5091005081 is 1805001905.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5091005081 - 210 = 5091004057 is a prime.
It is a super-2 number, since 2×50910050812 = 51836665469535633122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5091005089) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2572826 + ... + 2574803.
It is an arithmetic number, because the mean of its divisors is an integer number (679487160).
Almost surely, 25091005081 is an apocalyptic number.
It is an amenable number.
5091005081 is a deficient number, since it is larger than the sum of its proper divisors (344892199).
5091005081 is a wasteful number, since it uses less digits than its factorization.
5091005081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5147695.
The product of its (nonzero) digits is 1800, while the sum is 29.
The square root of 5091005081 is about 71351.2794629501. The cubic root of 5091005081 is about 1720.2880670617.
Adding to 5091005081 its reverse (1805001905), we get a palindrome (6896006986).
The spelling of 5091005081 in words is "five billion, ninety-one million, five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •