Base | Representation |
---|---|
bin | 1010001100001000… |
… | …00111000110001001 |
3 | 112010020121122201101 |
4 | 11012010013012021 |
5 | 42200413400212 |
6 | 2302454421401 |
7 | 252364025662 |
oct | 50604070611 |
9 | 15106548641 |
10 | 5470450057 |
11 | 2357a21106 |
12 | 1088061861 |
13 | 6924687c7 |
14 | 39c764369 |
15 | 2203d4157 |
hex | 146107189 |
5470450057 has 2 divisors, whose sum is σ = 5470450058. Its totient is φ = 5470450056.
The previous prime is 5470450033. The next prime is 5470450081. The reversal of 5470450057 is 7500540745.
It is a balanced prime because it is at equal distance from previous prime (5470450033) and next prime (5470450081).
It can be written as a sum of positive squares in only one way, i.e., 3819734416 + 1650715641 = 61804^2 + 40629^2 .
It is a cyclic number.
It is not a de Polignac number, because 5470450057 - 215 = 5470417289 is a prime.
It is a super-2 number, since 2×54704500572 = 59851647652262606498, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5470449998 and 5470450025.
It is not a weakly prime, because it can be changed into another prime (5470400057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2735225028 + 2735225029.
It is an arithmetic number, because the mean of its divisors is an integer number (2735225029).
Almost surely, 25470450057 is an apocalyptic number.
It is an amenable number.
5470450057 is a deficient number, since it is larger than the sum of its proper divisors (1).
5470450057 is an equidigital number, since it uses as much as digits as its factorization.
5470450057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 98000, while the sum is 37.
The square root of 5470450057 is about 73962.4908788232. The cubic root of 5470450057 is about 1762.0072288185.
The spelling of 5470450057 in words is "five billion, four hundred seventy million, four hundred fifty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •