Base | Representation |
---|---|
bin | 100000110100000000000110… |
… | …100111101011101001101000 |
3 | 200220221222221120021120021101 |
4 | 200310000012213223221220 |
5 | 122403342423111230204 |
6 | 1230531321440051144 |
7 | 42253061261340061 |
oct | 4064000647535150 |
9 | 626858846246241 |
10 | 144311012211304 |
11 | 41a88a58238494 |
12 | 14228536003ab4 |
13 | 626a6159495a3 |
14 | 278c9940db568 |
15 | 11a3cd9807ea4 |
hex | 8340069eba68 |
144311012211304 has 8 divisors (see below), whose sum is σ = 270583147896210. Its totient is φ = 72155506105648.
The previous prime is 144311012211293. The next prime is 144311012211329. The reversal of 144311012211304 is 403112210113441.
It can be written as a sum of positive squares in only one way, i.e., 144270126562500 + 40885648804 = 12011250^2 + 202202^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1443110122113042 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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, 9019438263199 + ... + 9019438263214.
Almost surely, 2144311012211304 is an apocalyptic number.
It is an amenable number.
144311012211304 is a deficient number, since it is larger than the sum of its proper divisors (126272135684906).
144311012211304 is a wasteful number, since it uses less digits than its factorization.
144311012211304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18038876526419 (or 18038876526415 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 144311012211304 its reverse (403112210113441), we get a palindrome (547423222324745).
The spelling of 144311012211304 in words is "one hundred forty-four trillion, three hundred eleven billion, twelve million, two hundred eleven thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •