Base | Representation |
---|---|
bin | 1000011010100000111… |
… | …0001111010001000001 |
3 | 111211010101001010021112 |
4 | 2012220032033101001 |
5 | 4332022343204401 |
6 | 150224101333105 |
7 | 13305144433604 |
oct | 2065016172101 |
9 | 454111033245 |
10 | 144556225601 |
11 | 56340247947 |
12 | 24023707195 |
13 | 108297c3788 |
14 | 6dd47b233b |
15 | 3b60c193bb |
hex | 21a838f441 |
144556225601 has 4 divisors (see below), whose sum is σ = 150841278912. Its totient is φ = 138271172292.
The previous prime is 144556225591. The next prime is 144556225699. The reversal of 144556225601 is 106522655441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 106522655441 = 89 ⋅1196883769.
It is a cyclic number.
It is not a de Polignac number, because 144556225601 - 26 = 144556225537 is a prime.
It is a super-2 number, since 2×1445562256012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144556225501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3142526621 + ... + 3142526666.
It is an arithmetic number, because the mean of its divisors is an integer number (37710319728).
Almost surely, 2144556225601 is an apocalyptic number.
It is an amenable number.
144556225601 is a deficient number, since it is larger than the sum of its proper divisors (6285053311).
144556225601 is an equidigital number, since it uses as much as digits as its factorization.
144556225601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6285053310.
The product of its (nonzero) digits is 288000, while the sum is 41.
The spelling of 144556225601 in words is "one hundred forty-four billion, five hundred fifty-six million, two hundred twenty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •