Base | Representation |
---|---|
bin | 100000110100000000001000… |
… | …010101100101010100101000 |
3 | 200220222000000120111021001110 |
4 | 200310000020111211110220 |
5 | 122403343003000134344 |
6 | 1230531324345350320 |
7 | 42253062061251030 |
oct | 4064001025452450 |
9 | 626860016437043 |
10 | 144311041021224 |
11 | 41a88a72525840 |
12 | 142285437983a0 |
13 | 626a61b8c598c |
14 | 278c997c7a8c0 |
15 | 11a3cdc0e93b9 |
hex | 834008565528 |
144311041021224 has 128 divisors (see below), whose sum is σ = 450284829926400. Its totient is φ = 37443038730240.
The previous prime is 144311041021219. The next prime is 144311041021247. The reversal of 144311041021224 is 422120140113441.
It is a junction number, because it is equal to n+sod(n) for n = 144311041021191 and 144311041021200.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40312482 + ... + 43746065.
It is an arithmetic number, because the mean of its divisors is an integer number (3517850233800).
Almost surely, 2144311041021224 is an apocalyptic number.
144311041021224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
144311041021224 is an abundant number, since it is smaller than the sum of its proper divisors (305973788905176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144311041021224 is a wasteful number, since it uses less digits than its factorization.
144311041021224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84059503 (or 84059499 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 144311041021224 its reverse (422120140113441), we get a palindrome (566431181134665).
The spelling of 144311041021224 in words is "one hundred forty-four trillion, three hundred eleven billion, forty-one million, twenty-one thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •