Base | Representation |
---|---|
bin | 1000011000100001010… |
… | …1010111101010100101 |
3 | 111202202002100020012011 |
4 | 2012020111113222211 |
5 | 4324423413132401 |
6 | 150055030354221 |
7 | 13255660130506 |
oct | 2061025275245 |
9 | 452662306164 |
10 | 144021224101 |
11 | 56096254347 |
12 | 23ab44bb971 |
13 | 10772a05041 |
14 | 6d83708bad |
15 | 3b2dc8a451 |
hex | 2188557aa5 |
144021224101 has 2 divisors, whose sum is σ = 144021224102. Its totient is φ = 144021224100.
The previous prime is 144021224059. The next prime is 144021224141. The reversal of 144021224101 is 101422120441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133664091201 + 10357132900 = 365601^2 + 101770^2 .
It is a cyclic number.
It is not a de Polignac number, because 144021224101 - 29 = 144021223589 is a prime.
It is a super-2 number, since 2×1440212241012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144021224141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72010612050 + 72010612051.
It is an arithmetic number, because the mean of its divisors is an integer number (72010612051).
Almost surely, 2144021224101 is an apocalyptic number.
It is an amenable number.
144021224101 is a deficient number, since it is larger than the sum of its proper divisors (1).
144021224101 is an equidigital number, since it uses as much as digits as its factorization.
144021224101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 144021224101 its reverse (101422120441), we get a palindrome (245443344542).
The spelling of 144021224101 in words is "one hundred forty-four billion, twenty-one million, two hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •