Base | Representation |
---|---|
bin | 100000110101111000110100… |
… | …101100001100010110001111 |
3 | 200221102101112010212001100021 |
4 | 200311320310230030112033 |
5 | 122413003404321231443 |
6 | 1231111040012243011 |
7 | 42265330364635366 |
oct | 4065706454142617 |
9 | 627371463761307 |
10 | 144440634164623 |
11 | 42028a24476545 |
12 | 14249690170467 |
13 | 62799023c8054 |
14 | 2794d6d2b87dd |
15 | 11a73743929ed |
hex | 835e34b0c58f |
144440634164623 has 4 divisors (see below), whose sum is σ = 149100009460288. Its totient is φ = 139781258868960.
The previous prime is 144440634164611. The next prime is 144440634164797. The reversal of 144440634164623 is 326461436044441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 144440634164623 - 233 = 144432044230031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144440644164623) 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, 2329687647786 + ... + 2329687647847.
It is an arithmetic number, because the mean of its divisors is an integer number (37275002365072).
Almost surely, 2144440634164623 is an apocalyptic number.
144440634164623 is a deficient number, since it is larger than the sum of its proper divisors (4659375295665).
144440634164623 is an equidigital number, since it uses as much as digits as its factorization.
144440634164623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4659375295664.
The product of its (nonzero) digits is 15925248, while the sum is 52.
The spelling of 144440634164623 in words is "one hundred forty-four trillion, four hundred forty billion, six hundred thirty-four million, one hundred sixty-four thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •