Base | Representation |
---|---|
bin | 1001100101000000… |
… | …00010011001001111 |
3 | 111021101000011122202 |
4 | 10302200002121033 |
5 | 41012402222021 |
6 | 2210131432115 |
7 | 241300130012 |
oct | 46240023117 |
9 | 14241004582 |
10 | 5142226511 |
11 | 21a971a984 |
12 | bb615563b |
13 | 63c4684a6 |
14 | 36ad25379 |
15 | 20169ca0b |
hex | 13280264f |
5142226511 has 4 divisors (see below), whose sum is σ = 5143808592. Its totient is φ = 5140644432.
The previous prime is 5142226501. The next prime is 5142226513. The reversal of 5142226511 is 1156222415.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1156222415 = 5 ⋅231244483.
It is a cyclic number.
It is not a de Polignac number, because 5142226511 - 218 = 5141964367 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5142226513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 786155 + ... + 792668.
It is an arithmetic number, because the mean of its divisors is an integer number (1285952148).
Almost surely, 25142226511 is an apocalyptic number.
5142226511 is a deficient number, since it is larger than the sum of its proper divisors (1582081).
5142226511 is a wasteful number, since it uses less digits than its factorization.
5142226511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582080.
The product of its digits is 4800, while the sum is 29.
The square root of 5142226511 is about 71709.3195547134. The cubic root of 5142226511 is about 1726.0381916459.
Adding to 5142226511 its reverse (1156222415), we get a palindrome (6298448926).
The spelling of 5142226511 in words is "five billion, one hundred forty-two million, two hundred twenty-six thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •