Base | Representation |
---|---|
bin | 1001010101010110… |
… | …11110001001100011 |
3 | 110221020002111000201 |
4 | 10222223132021203 |
5 | 40230304143201 |
6 | 2145123130031 |
7 | 235114564042 |
oct | 45253361143 |
9 | 13836074021 |
10 | 5011006051 |
11 | 2141645017 |
12 | b7a213917 |
13 | 61b21334c |
14 | 357728559 |
15 | 1e4dcc801 |
hex | 12aade263 |
5011006051 has 4 divisors (see below), whose sum is σ = 5011611912. Its totient is φ = 5010400192.
The previous prime is 5011006043. The next prime is 5011006057. The reversal of 5011006051 is 1506001105.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5011006051 - 23 = 5011006043 is a prime.
It is a super-2 number, since 2×50110060512 = 50220363286317229202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5011006057) 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 3 ways as a sum of consecutive naturals, for example, 290350 + ... + 307123.
It is an arithmetic number, because the mean of its divisors is an integer number (1252902978).
Almost surely, 25011006051 is an apocalyptic number.
5011006051 is a deficient number, since it is larger than the sum of its proper divisors (605861).
5011006051 is an equidigital number, since it uses as much as digits as its factorization.
5011006051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605860.
The product of its (nonzero) digits is 150, while the sum is 19.
The square root of 5011006051 is about 70788.4598716486. The cubic root of 5011006051 is about 1711.2296993670.
Adding to 5011006051 its reverse (1506001105), we get a palindrome (6517007156).
The spelling of 5011006051 in words is "five billion, eleven million, six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •