Base | Representation |
---|---|
bin | 101011000100010… |
… | …0001000011110001 |
3 | 10201201011022200022 |
4 | 1112020201003301 |
5 | 10424414320022 |
6 | 355220533225 |
7 | 50544630134 |
oct | 12610410361 |
9 | 3651138608 |
10 | 1445073137 |
11 | 681784922 |
12 | 343b51215 |
13 | 1a0500481 |
14 | d9cc621b |
15 | 86ce9c42 |
hex | 562210f1 |
1445073137 has 2 divisors, whose sum is σ = 1445073138. Its totient is φ = 1445073136.
The previous prime is 1445073121. The next prime is 1445073173. The reversal of 1445073137 is 7313705441.
Together with next prime (1445073173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1049500816 + 395572321 = 32396^2 + 19889^2 .
It is a cyclic number.
It is not a de Polignac number, because 1445073137 - 24 = 1445073121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1445073097 and 1445073106.
It is not a weakly prime, because it can be changed into another prime (1445073107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 722536568 + 722536569.
It is an arithmetic number, because the mean of its divisors is an integer number (722536569).
Almost surely, 21445073137 is an apocalyptic number.
It is an amenable number.
1445073137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1445073137 is an equidigital number, since it uses as much as digits as its factorization.
1445073137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 35280, while the sum is 35.
The square root of 1445073137 is about 38014.1176012281. The cubic root of 1445073137 is about 1130.5677928105.
Adding to 1445073137 its reverse (7313705441), we get a palindrome (8758778578).
The spelling of 1445073137 in words is "one billion, four hundred forty-five million, seventy-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •