Base | Representation |
---|---|
bin | 1000011001110100110… |
… | …1011111010111101111 |
3 | 111210122111102002000121 |
4 | 2012131031133113233 |
5 | 4331133044330142 |
6 | 150153501505411 |
7 | 13300442222044 |
oct | 2063515372757 |
9 | 453574362017 |
10 | 144371480047 |
11 | 56255a33873 |
12 | 23b91872267 |
13 | 107ca44a892 |
14 | 6db80411cb |
15 | 3b4e8c4c67 |
hex | 219d35f5ef |
144371480047 has 4 divisors (see below), whose sum is σ = 144627913080. Its totient is φ = 144115047016.
The previous prime is 144371480039. The next prime is 144371480053. The reversal of 144371480047 is 740084173441.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 740084173441 = 211 ⋅3507507931.
It is a cyclic number.
It is not a de Polignac number, because 144371480047 - 23 = 144371480039 is a prime.
It is a super-2 number, since 2×1443714800472 (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 = 144371479985 and 144371480012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144371480947) 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, 128215672 + ... + 128216797.
It is an arithmetic number, because the mean of its divisors is an integer number (36156978270).
Almost surely, 2144371480047 is an apocalyptic number.
144371480047 is a deficient number, since it is larger than the sum of its proper divisors (256433033).
144371480047 is an equidigital number, since it uses as much as digits as its factorization.
144371480047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256433032.
The product of its (nonzero) digits is 301056, while the sum is 43.
The spelling of 144371480047 in words is "one hundred forty-four billion, three hundred seventy-one million, four hundred eighty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •