Base | Representation |
---|---|
bin | 1000011010010011110… |
… | …1010111110010111111 |
3 | 111210222120000101001221 |
4 | 2012210331113302333 |
5 | 4331414334104242 |
6 | 150214424014211 |
7 | 13303611151453 |
oct | 2064475276277 |
9 | 453876011057 |
10 | 144501472447 |
11 | 56312350002 |
12 | 24009301367 |
13 | 1081b362a67 |
14 | 6dcb3dc663 |
15 | 3b5b001167 |
hex | 21a4f57cbf |
144501472447 has 4 divisors (see below), whose sum is σ = 144619626960. Its totient is φ = 144383317936.
The previous prime is 144501472403. The next prime is 144501472459. The reversal of 144501472447 is 744274105441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144501472447 is a prime.
It is a super-2 number, since 2×1445014724472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144501470447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59075422 + ... + 59077867.
It is an arithmetic number, because the mean of its divisors is an integer number (36154906740).
Almost surely, 2144501472447 is an apocalyptic number.
144501472447 is a deficient number, since it is larger than the sum of its proper divisors (118154513).
144501472447 is a wasteful number, since it uses less digits than its factorization.
144501472447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118154512.
The product of its (nonzero) digits is 501760, while the sum is 43.
Adding to 144501472447 its reverse (744274105441), we get a palindrome (888775577888).
The spelling of 144501472447 in words is "one hundred forty-four billion, five hundred one million, four hundred seventy-two thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •