Base | Representation |
---|---|
bin | 1001010101100111… |
… | …01010101011011011 |
3 | 110221101010122011202 |
4 | 10222303222223123 |
5 | 40231331421043 |
6 | 2145241144415 |
7 | 235142052566 |
oct | 45263525333 |
9 | 13841118152 |
10 | 5013154523 |
11 | 2142882213 |
12 | b7aa8b10b |
13 | 61b7b6230 |
14 | 357b274dd |
15 | 1e51a41b8 |
hex | 12aceaadb |
5013154523 has 4 divisors (see below), whose sum is σ = 5398781808. Its totient is φ = 4627527240.
The previous prime is 5013154507. The next prime is 5013154537. The reversal of 5013154523 is 3254513105.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3254513105 = 5 ⋅650902621.
It is a cyclic number.
It is not a de Polignac number, because 5013154523 - 24 = 5013154507 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5013154423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 192813623 + ... + 192813648.
It is an arithmetic number, because the mean of its divisors is an integer number (1349695452).
Almost surely, 25013154523 is an apocalyptic number.
5013154523 is a deficient number, since it is larger than the sum of its proper divisors (385627285).
5013154523 is a wasteful number, since it uses less digits than its factorization.
5013154523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385627284.
The product of its (nonzero) digits is 9000, while the sum is 29.
The square root of 5013154523 is about 70803.6335437667. The cubic root of 5013154523 is about 1711.4742280268.
Adding to 5013154523 its reverse (3254513105), we get a palindrome (8267667628).
The spelling of 5013154523 in words is "five billion, thirteen million, one hundred fifty-four thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •