Base | Representation |
---|---|
bin | 100000111110111001110011… |
… | …101000000110011101111101 |
3 | 201000121121122100001222110212 |
4 | 200332321303220012131331 |
5 | 123003131204312102242 |
6 | 1232303415303442205 |
7 | 42361152061045562 |
oct | 4076716350063575 |
9 | 630547570058425 |
10 | 145060165347197 |
11 | 4224774169a641 |
12 | 1432976ba56365 |
13 | 62c3165575409 |
14 | 27b6d41488869 |
15 | 11b8533c22782 |
hex | 83ee73a0677d |
145060165347197 has 2 divisors, whose sum is σ = 145060165347198. Its totient is φ = 145060165347196.
The previous prime is 145060165347143. The next prime is 145060165347269. The reversal of 145060165347197 is 791743561060541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112929112029721 + 32131053317476 = 10626811^2 + 5668426^2 .
It is a cyclic number.
It is not a de Polignac number, because 145060165347197 - 224 = 145060148569981 is a prime.
It is a super-2 number, since 2×1450601653471972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145060165347127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72530082673598 + 72530082673599.
It is an arithmetic number, because the mean of its divisors is an integer number (72530082673599).
Almost surely, 2145060165347197 is an apocalyptic number.
It is an amenable number.
145060165347197 is a deficient number, since it is larger than the sum of its proper divisors (1).
145060165347197 is an equidigital number, since it uses as much as digits as its factorization.
145060165347197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19051200, while the sum is 59.
The spelling of 145060165347197 in words is "one hundred forty-five trillion, sixty billion, one hundred sixty-five million, three hundred forty-seven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •