Base | Representation |
---|---|
bin | 1001010101010111… |
… | …01001111111100111 |
3 | 110221020011221120121 |
4 | 10222223221333213 |
5 | 40230312221232 |
6 | 2145124142411 |
7 | 235115155351 |
oct | 45253517747 |
9 | 13836157517 |
10 | 5011054567 |
11 | 2141678512 |
12 | b7a237a07 |
13 | 61b22c45c |
14 | 35773c0d1 |
15 | 1e4ddbd97 |
hex | 12aae9fe7 |
5011054567 has 4 divisors (see below), whose sum is σ = 5027064640. Its totient is φ = 4995044496.
The previous prime is 5011054561. The next prime is 5011054571. The reversal of 5011054567 is 7654501105.
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 5011054567 - 223 = 5002665959 is a prime.
It is a super-2 number, since 2×50110545672 = 50221335746903114978, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011054561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8004567 + ... + 8005192.
It is an arithmetic number, because the mean of its divisors is an integer number (1256766160).
Almost surely, 25011054567 is an apocalyptic number.
5011054567 is a deficient number, since it is larger than the sum of its proper divisors (16010073).
5011054567 is a wasteful number, since it uses less digits than its factorization.
5011054567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16010072.
The product of its (nonzero) digits is 21000, while the sum is 34.
The square root of 5011054567 is about 70788.8025537938. The cubic root of 5011054567 is about 1711.2352219940.
The spelling of 5011054567 in words is "five billion, eleven million, fifty-four thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •