Base | Representation |
---|---|
bin | 100000110011111111010111… |
… | …100001010100010000000001 |
3 | 200220221220220111101100120212 |
4 | 200303333113201110100001 |
5 | 122403334313313412231 |
6 | 1230531111211243505 |
7 | 42253032554640161 |
oct | 4063772741242001 |
9 | 626856814340525 |
10 | 144310222013441 |
11 | 41a88692192100 |
12 | 14228355449595 |
13 | 626a51b0191a3 |
14 | 278c91b1a45a1 |
15 | 11a3c9026a42b |
hex | 833fd7854401 |
144310222013441 has 48 divisors (see below), whose sum is σ = 161727175357440. Its totient is φ = 128648752848000.
The previous prime is 144310222013387. The next prime is 144310222013467.
144310222013441 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-144310222013441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144310222013398 and 144310222013407.
It is not an unprimeable number, because it can be changed into a prime (144310222013641) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3526019120 + ... + 3526060046.
It is an arithmetic number, because the mean of its divisors is an integer number (3369316153280).
Almost surely, 2144310222013441 is an apocalyptic number.
144310222013441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
144310222013441 is a deficient number, since it is larger than the sum of its proper divisors (17416953343999).
144310222013441 is a wasteful number, since it uses less digits than its factorization.
144310222013441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43806 (or 43795 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 32.
The spelling of 144310222013441 in words is "one hundred forty-four trillion, three hundred ten billion, two hundred twenty-two million, thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •