Base | Representation |
---|---|
bin | 1001010110100101… |
… | …00100001100000101 |
3 | 110221221101011010101 |
4 | 10223102210030011 |
5 | 40240420120110 |
6 | 2150130524101 |
7 | 235300646446 |
oct | 45322441405 |
9 | 13857334111 |
10 | 5021254405 |
11 | 2147404832 |
12 | b81736631 |
13 | 620390c6b |
14 | 358c352cd |
15 | 1e5c5413a |
hex | 12b4a4305 |
5021254405 has 4 divisors (see below), whose sum is σ = 6025505292. Its totient is φ = 4017003520.
The previous prime is 5021254367. The next prime is 5021254417. The reversal of 5021254405 is 5044521205.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5044521205 = 5 ⋅1008904241.
It can be written as a sum of positive squares in 2 ways, for example, as 2937423204 + 2083831201 = 54198^2 + 45649^2 .
It is not a de Polignac number, because 5021254405 - 29 = 5021253893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 502125436 + ... + 502125445.
It is an arithmetic number, because the mean of its divisors is an integer number (1506376323).
Almost surely, 25021254405 is an apocalyptic number.
It is an amenable number.
5021254405 is a deficient number, since it is larger than the sum of its proper divisors (1004250887).
5021254405 is a wasteful number, since it uses less digits than its factorization.
5021254405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004250886.
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 5021254405 is about 70860.8100786323. The cubic root of 5021254405 is about 1712.3954895995.
The spelling of 5021254405 in words is "five billion, twenty-one million, two hundred fifty-four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •