Base | Representation |
---|---|
bin | 100001000010111010111010… |
… | …001001010000110100001101 |
3 | 201001121000012111120001220221 |
4 | 201002322322021100310031 |
5 | 123022142042421234042 |
6 | 1233034312441111341 |
7 | 42420124113632413 |
oct | 4102727211206415 |
9 | 631530174501827 |
10 | 145336226352397 |
11 | 42343824960813 |
12 | 14373174188551 |
13 | 63131bb917332 |
14 | 27c644d1112b3 |
15 | 11c07de940d67 |
hex | 842eba250d0d |
145336226352397 has 2 divisors, whose sum is σ = 145336226352398. Its totient is φ = 145336226352396.
The previous prime is 145336226352353. The next prime is 145336226352409. The reversal of 145336226352397 is 793253622633541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144327690213316 + 1008536139081 = 12013646^2 + 1004259^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145336226352397 is a prime.
It is a super-2 number, since 2×1453362263523972 (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 (145336226352307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72668113176198 + 72668113176199.
It is an arithmetic number, because the mean of its divisors is an integer number (72668113176199).
Almost surely, 2145336226352397 is an apocalyptic number.
It is an amenable number.
145336226352397 is a deficient number, since it is larger than the sum of its proper divisors (1).
145336226352397 is an equidigital number, since it uses as much as digits as its factorization.
145336226352397 is an evil number, because the sum of its binary digits is even.
The product of its digits is 146966400, while the sum is 61.
The spelling of 145336226352397 in words is "one hundred forty-five trillion, three hundred thirty-six billion, two hundred twenty-six million, three hundred fifty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •