Base | Representation |
---|---|
bin | 1000011001101001010… |
… | …1111100001011001011 |
3 | 111210112010212111120102 |
4 | 2012122111330023023 |
5 | 4331033240113111 |
6 | 150145022320015 |
7 | 13266316230464 |
oct | 2063225741313 |
9 | 453463774512 |
10 | 144323363531 |
11 | 5623085a156 |
12 | 23b7972900b |
13 | 107c04a1879 |
14 | 6db18b7d6b |
15 | 3b4a56d13b |
hex | 219a57c2cb |
144323363531 has 2 divisors, whose sum is σ = 144323363532. Its totient is φ = 144323363530.
The previous prime is 144323363507. The next prime is 144323363537. The reversal of 144323363531 is 135363323441.
144323363531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 144323363531 - 230 = 143249621707 is a prime.
It is a super-2 number, since 2×1443233635312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (144323363537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72161681765 + 72161681766.
It is an arithmetic number, because the mean of its divisors is an integer number (72161681766).
Almost surely, 2144323363531 is an apocalyptic number.
144323363531 is a deficient number, since it is larger than the sum of its proper divisors (1).
144323363531 is an equidigital number, since it uses as much as digits as its factorization.
144323363531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 233280, while the sum is 38.
Adding to 144323363531 its reverse (135363323441), we get a palindrome (279686686972).
The spelling of 144323363531 in words is "one hundred forty-four billion, three hundred twenty-three million, three hundred sixty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •