Base | Representation |
---|---|
bin | 100001000111111110111011… |
… | …101010010010111010101111 |
3 | 201002211021020111020220210102 |
4 | 201013332323222102322233 |
5 | 123043342111344434301 |
6 | 1233502212154501315 |
7 | 42454221621216434 |
oct | 4107767352227257 |
9 | 632737214226712 |
10 | 145684144139951 |
11 | 4246833143102a |
12 | 1440a69113483b |
13 | 6339c56cb5191 |
14 | 27d9216207b8b |
15 | 11c98a3c92b6b |
hex | 847fbba92eaf |
145684144139951 has 2 divisors, whose sum is σ = 145684144139952. Its totient is φ = 145684144139950.
The previous prime is 145684144139843. The next prime is 145684144140023. The reversal of 145684144139951 is 159931441486541.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145684144139951 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145684144169951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72842072069975 + 72842072069976.
It is an arithmetic number, because the mean of its divisors is an integer number (72842072069976).
Almost surely, 2145684144139951 is an apocalyptic number.
145684144139951 is a deficient number, since it is larger than the sum of its proper divisors (1).
145684144139951 is an equidigital number, since it uses as much as digits as its factorization.
145684144139951 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 74649600, while the sum is 65.
The spelling of 145684144139951 in words is "one hundred forty-five trillion, six hundred eighty-four billion, one hundred forty-four million, one hundred thirty-nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •