Base | Representation |
---|---|
bin | 1000011010101100111… |
… | …0111000110100010001 |
3 | 111211020220001212210001 |
4 | 2012223032320310101 |
5 | 4332123310234231 |
6 | 150233104010001 |
7 | 13306326621361 |
oct | 2065316706421 |
9 | 454226055701 |
10 | 144606727441 |
11 | 56366800700 |
12 | 24038600901 |
13 | 108370c6417 |
14 | 6ddb39a9a1 |
15 | 3b65392b61 |
hex | 21ab3b8d11 |
144606727441 has 24 divisors (see below), whose sum is σ = 161357821632. Its totient is φ = 129471434400.
The previous prime is 144606727427. The next prime is 144606727451. The reversal of 144606727441 is 144727606441.
It is not a de Polignac number, because 144606727441 - 217 = 144606596369 is a prime.
It is a super-2 number, since 2×1446067274412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144606727391 and 144606727400.
It is not an unprimeable number, because it can be changed into a prime (144606727451) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8556786 + ... + 8573668.
It is an arithmetic number, because the mean of its divisors is an integer number (6723242568).
Almost surely, 2144606727441 is an apocalyptic number.
144606727441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
144606727441 is a deficient number, since it is larger than the sum of its proper divisors (16751094191).
144606727441 is a wasteful number, since it uses less digits than its factorization.
144606727441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17973 (or 17962 counting only the distinct ones).
The product of its (nonzero) digits is 903168, while the sum is 46.
The spelling of 144606727441 in words is "one hundred forty-four billion, six hundred six million, seven hundred twenty-seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •