Base | Representation |
---|---|
bin | 1010000110111000… |
… | …10001000000000101 |
3 | 112000011211020120211 |
4 | 11003130101000011 |
5 | 42103132403222 |
6 | 2254243355421 |
7 | 251321032132 |
oct | 50334210005 |
9 | 15004736524 |
10 | 5426450437 |
11 | 23350a9591 |
12 | 1075382b71 |
13 | 686301625 |
14 | 39698d589 |
15 | 21b5e2277 |
hex | 143711005 |
5426450437 has 2 divisors, whose sum is σ = 5426450438. Its totient is φ = 5426450436.
The previous prime is 5426450431. The next prime is 5426450509. The reversal of 5426450437 is 7340546245.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4590604516 + 835845921 = 67754^2 + 28911^2 .
It is a cyclic number.
It is not a de Polignac number, because 5426450437 - 227 = 5292232709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5426450437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5426450431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2713225218 + 2713225219.
It is an arithmetic number, because the mean of its divisors is an integer number (2713225219).
Almost surely, 25426450437 is an apocalyptic number.
It is an amenable number.
5426450437 is a deficient number, since it is larger than the sum of its proper divisors (1).
5426450437 is an equidigital number, since it uses as much as digits as its factorization.
5426450437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 403200, while the sum is 40.
The square root of 5426450437 is about 73664.4448631767. Note that the first 3 decimals coincide. The cubic root of 5426450437 is about 1757.2704803580.
The spelling of 5426450437 in words is "five billion, four hundred twenty-six million, four hundred fifty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •