Base | Representation |
---|---|
bin | 100001000100011000110011… |
… | …001001100111000101001101 |
3 | 201001221122102102121022110021 |
4 | 201010120303021213011031 |
5 | 123030320024412001131 |
6 | 1233152504255142141 |
7 | 42430323310015033 |
oct | 4104306311470515 |
9 | 631848372538407 |
10 | 145437040734541 |
11 | 42382558a60206 |
12 | 1438a80a814951 |
13 | 631c867073caa |
14 | 27cb2943a2553 |
15 | 11c32403e3e11 |
hex | 84463326714d |
145437040734541 has 2 divisors, whose sum is σ = 145437040734542. Its totient is φ = 145437040734540.
The previous prime is 145437040734511. The next prime is 145437040734577.
145437040734541 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145068414469225 + 368626265316 = 12044435^2 + 607146^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 145437040734541 - 27 = 145437040734413 is a prime.
It is a super-4 number, since 4×1454370407345414 (a number of 58 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145437040734511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72718520367270 + 72718520367271.
It is an arithmetic number, because the mean of its divisors is an integer number (72718520367271).
Almost surely, 2145437040734541 is an apocalyptic number.
It is an amenable number.
145437040734541 is a deficient number, since it is larger than the sum of its proper divisors (1).
145437040734541 is an equidigital number, since it uses as much as digits as its factorization.
145437040734541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11289600, while the sum is 52.
The spelling of 145437040734541 in words is "one hundred forty-five trillion, four hundred thirty-seven billion, forty million, seven hundred thirty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •