Base | Representation |
---|---|
bin | 1000001111000… |
… | …11101011110101 |
3 | 11211000010201021 |
4 | 10013203223311 |
5 | 120141340122 |
6 | 10504501141 |
7 | 1466153452 |
oct | 407435365 |
9 | 154003637 |
10 | 69090037 |
11 | 35aaa405 |
12 | 1b17a7b1 |
13 | 114105a3 |
14 | 9266829 |
15 | 60eb1c7 |
hex | 41e3af5 |
69090037 has 2 divisors, whose sum is σ = 69090038. Its totient is φ = 69090036.
The previous prime is 69090019. The next prime is 69090079. The reversal of 69090037 is 73009096.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34586161 + 34503876 = 5881^2 + 5874^2 .
It is a cyclic number.
It is not a de Polignac number, because 69090037 - 211 = 69087989 is a prime.
It is a super-2 number, since 2×690900372 = 9546866425322738, which contains 22 as substring.
It is equal to p4067656 and since 69090037 and 4067656 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 69089984 and 69090011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69090017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34545018 + 34545019.
It is an arithmetic number, because the mean of its divisors is an integer number (34545019).
Almost surely, 269090037 is an apocalyptic number.
It is an amenable number.
69090037 is a deficient number, since it is larger than the sum of its proper divisors (1).
69090037 is an equidigital number, since it uses as much as digits as its factorization.
69090037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 34.
The square root of 69090037 is about 8312.0416866135. The cubic root of 69090037 is about 410.3349176948.
The spelling of 69090037 in words is "sixty-nine million, ninety thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •