Base | Representation |
---|---|
bin | 1001100110011101… |
… | …11001011000010011 |
3 | 111022020010020220221 |
4 | 10303032321120103 |
5 | 41024023312410 |
6 | 2211251013511 |
7 | 241506420661 |
oct | 46316713023 |
9 | 14266106827 |
10 | 5154510355 |
11 | 220564aa15 |
12 | bba29a297 |
13 | 641b79737 |
14 | 36c801c31 |
15 | 2027c74da |
hex | 1333b9613 |
5154510355 has 4 divisors (see below), whose sum is σ = 6185412432. Its totient is φ = 4123608280.
The previous prime is 5154510353. The next prime is 5154510379. The reversal of 5154510355 is 5530154515.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5530154515 = 5 ⋅1106030903.
It is not a de Polignac number, because 5154510355 - 21 = 5154510353 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 5154510355.
It is not an unprimeable number, because it can be changed into a prime (5154510353) 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, 515451031 + ... + 515451040.
It is an arithmetic number, because the mean of its divisors is an integer number (1546353108).
Almost surely, 25154510355 is an apocalyptic number.
5154510355 is a deficient number, since it is larger than the sum of its proper divisors (1030902077).
5154510355 is a wasteful number, since it uses less digits than its factorization.
5154510355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030902076.
The product of its (nonzero) digits is 37500, while the sum is 34.
The square root of 5154510355 is about 71794.9187268848. The cubic root of 5154510355 is about 1727.4114958187.
The spelling of 5154510355 in words is "five billion, one hundred fifty-four million, five hundred ten thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •