Base | Representation |
---|---|
bin | 1001011010100001… |
… | …01101101011010011 |
3 | 111001020121020021101 |
4 | 10231100231223103 |
5 | 40322401322121 |
6 | 2153311405231 |
7 | 236152016524 |
oct | 45520555323 |
9 | 14036536241 |
10 | 5054323411 |
11 | 2164040a95 |
12 | b90823817 |
13 | 62719bb17 |
14 | 35d3a284b |
15 | 1e8ad7491 |
hex | 12d42dad3 |
5054323411 has 4 divisors (see below), whose sum is σ = 5123560792. Its totient is φ = 4985086032.
The previous prime is 5054323381. The next prime is 5054323433. The reversal of 5054323411 is 1143234505.
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 5054323411 - 27 = 5054323283 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5054323411.
It is not an unprimeable number, because it can be changed into a prime (5054323511) 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, 34618581 + ... + 34618726.
It is an arithmetic number, because the mean of its divisors is an integer number (1280890198).
Almost surely, 25054323411 is an apocalyptic number.
5054323411 is a deficient number, since it is larger than the sum of its proper divisors (69237381).
5054323411 is an equidigital number, since it uses as much as digits as its factorization.
5054323411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69237380.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 5054323411 is about 71093.7649235149. The cubic root of 5054323411 is about 1716.1464352833.
Adding to 5054323411 its reverse (1143234505), we get a palindrome (6197557916).
The spelling of 5054323411 in words is "five billion, fifty-four million, three hundred twenty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •