Base | Representation |
---|---|
bin | 100000111110111001110011… |
… | …101000000110100000001101 |
3 | 201000121121122100001222200012 |
4 | 200332321303220012200031 |
5 | 123003131204312103331 |
6 | 1232303415303443005 |
7 | 42361152061046156 |
oct | 4076716350064015 |
9 | 630547570058605 |
10 | 145060165347341 |
11 | 4224774169a762 |
12 | 1432976ba56465 |
13 | 62c31655754ba |
14 | 27b6d4148892d |
15 | 11b8533c2282b |
hex | 83ee73a0680d |
145060165347341 has 2 divisors, whose sum is σ = 145060165347342. Its totient is φ = 145060165347340.
The previous prime is 145060165347313. The next prime is 145060165347347. The reversal of 145060165347341 is 143743561060541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90787166932900 + 54272998414441 = 9528230^2 + 7367021^2 .
It is a cyclic number.
It is not a de Polignac number, because 145060165347341 - 226 = 145060098238477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145060165347341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145060165347347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72530082673670 + 72530082673671.
It is an arithmetic number, because the mean of its divisors is an integer number (72530082673671).
Almost surely, 2145060165347341 is an apocalyptic number.
It is an amenable number.
145060165347341 is a deficient number, since it is larger than the sum of its proper divisors (1).
145060165347341 is an equidigital number, since it uses as much as digits as its factorization.
145060165347341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3628800, while the sum is 50.
The spelling of 145060165347341 in words is "one hundred forty-five trillion, sixty billion, one hundred sixty-five million, three hundred forty-seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •