Base | Representation |
---|---|
bin | 10001010110110… |
… | …11000010101001 |
3 | 101010222021120211 |
4 | 20223123002221 |
5 | 244233210211 |
6 | 22240421121 |
7 | 3415404532 |
oct | 1053330251 |
9 | 333867524 |
10 | 145600681 |
11 | 75207a46 |
12 | 409177a1 |
13 | 2421b665 |
14 | 154a1689 |
15 | cbb0e21 |
hex | 8adb0a9 |
145600681 has 2 divisors, whose sum is σ = 145600682. Its totient is φ = 145600680.
The previous prime is 145600669. The next prime is 145600687. The reversal of 145600681 is 186006541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126765081 + 18835600 = 11259^2 + 4340^2 .
It is a cyclic number.
It is not a de Polignac number, because 145600681 - 211 = 145598633 is a prime.
It is a super-2 number, since 2×1456006812 = 42399116615327522, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (145600687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72800340 + 72800341.
It is an arithmetic number, because the mean of its divisors is an integer number (72800341).
Almost surely, 2145600681 is an apocalyptic number.
It is an amenable number.
145600681 is a deficient number, since it is larger than the sum of its proper divisors (1).
145600681 is an equidigital number, since it uses as much as digits as its factorization.
145600681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 31.
The square root of 145600681 is about 12066.5107218284. The cubic root of 145600681 is about 526.0832430530.
The spelling of 145600681 in words is "one hundred forty-five million, six hundred thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •