Base | Representation |
---|---|
bin | 100001000111000100100110… |
… | …101010000100101000111101 |
3 | 201002121021120201222110100211 |
4 | 201013010212222010220331 |
5 | 123041330330232443031 |
6 | 1233413333401152421 |
7 | 42446543613105535 |
oct | 4107044652045075 |
9 | 632537521873324 |
10 | 145621514734141 |
11 | 424438127a4516 |
12 | 143ba51278b711 |
13 | 633408588a684 |
14 | 27d619445a4c5 |
15 | 11c7e3a7a1bb1 |
hex | 847126a84a3d |
145621514734141 has 2 divisors, whose sum is σ = 145621514734142. Its totient is φ = 145621514734140.
The previous prime is 145621514734057. The next prime is 145621514734193. The reversal of 145621514734141 is 141437415126541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144393748796025 + 1227765938116 = 12016395^2 + 1108046^2 .
It is a cyclic number.
It is not a de Polignac number, because 145621514734141 - 27 = 145621514734013 is a prime.
It is a super-2 number, since 2×1456215147341412 (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 (145621514734841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72810757367070 + 72810757367071.
It is an arithmetic number, because the mean of its divisors is an integer number (72810757367071).
Almost surely, 2145621514734141 is an apocalyptic number.
It is an amenable number.
145621514734141 is a deficient number, since it is larger than the sum of its proper divisors (1).
145621514734141 is an equidigital number, since it uses as much as digits as its factorization.
145621514734141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1612800, while the sum is 49.
The spelling of 145621514734141 in words is "one hundred forty-five trillion, six hundred twenty-one billion, five hundred fourteen million, seven hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •