Base | Representation |
---|---|
bin | 1001101101010100… |
… | …10111010010100101 |
3 | 111110020101012001121 |
4 | 10312222113102211 |
5 | 41133240324110 |
6 | 2221104053541 |
7 | 243105425623 |
oct | 46652272245 |
9 | 14406335047 |
10 | 5212042405 |
11 | 2235075669 |
12 | 10156042b1 |
13 | 650a7127b |
14 | 3762da513 |
15 | 20788dcda |
hex | 136a974a5 |
5212042405 has 4 divisors (see below), whose sum is σ = 6254450892. Its totient is φ = 4169633920.
The previous prime is 5212042357. The next prime is 5212042471. The reversal of 5212042405 is 5042402125.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3213415969 + 1998626436 = 56687^2 + 44706^2 .
It is not a de Polignac number, because 5212042405 - 223 = 5203653797 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 5212042405.
It is a congruent number.
It is an unprimeable number.
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, 521204236 + ... + 521204245.
It is an arithmetic number, because the mean of its divisors is an integer number (1563612723).
Almost surely, 25212042405 is an apocalyptic number.
It is an amenable number.
5212042405 is a deficient number, since it is larger than the sum of its proper divisors (1042408487).
5212042405 is a wasteful number, since it uses less digits than its factorization.
5212042405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042408486.
The product of its (nonzero) digits is 3200, while the sum is 25.
The square root of 5212042405 is about 72194.4762776211. The cubic root of 5212042405 is about 1733.8145645039.
The spelling of 5212042405 in words is "five billion, two hundred twelve million, forty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •