Base | Representation |
---|---|
bin | 100000110100000000010100… |
… | …010001001111101001100101 |
3 | 200220222000112112011221001221 |
4 | 200310000110101033221211 |
5 | 122403343410222213334 |
6 | 1230531400300220341 |
7 | 42253100041654114 |
oct | 4064002421175145 |
9 | 626860475157057 |
10 | 144311241210469 |
11 | 41a890655279a3 |
12 | 1422859a83a6b1 |
13 | 626a651218158 |
14 | 278c9b66abc7b |
15 | 11a3cee98e8b4 |
hex | 83401444fa65 |
144311241210469 has 2 divisors, whose sum is σ = 144311241210470. Its totient is φ = 144311241210468.
The previous prime is 144311241210391. The next prime is 144311241210473. The reversal of 144311241210469 is 964012142113441.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141102610910244 + 3208630300225 = 11878662^2 + 1791265^2 .
It is a cyclic number.
It is not a de Polignac number, because 144311241210469 - 27 = 144311241210341 is a prime.
It is a super-2 number, since 2×1443112412104692 (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 (144312241210469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72155620605234 + 72155620605235.
It is an arithmetic number, because the mean of its divisors is an integer number (72155620605235).
Almost surely, 2144311241210469 is an apocalyptic number.
It is an amenable number.
144311241210469 is a deficient number, since it is larger than the sum of its proper divisors (1).
144311241210469 is an equidigital number, since it uses as much as digits as its factorization.
144311241210469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 165888, while the sum is 43.
The spelling of 144311241210469 in words is "one hundred forty-four trillion, three hundred eleven billion, two hundred forty-one million, two hundred ten thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •