Base | Representation |
---|---|
bin | 100000110001001110011010… |
… | …101010000011000111001111 |
3 | 200220021202111002110110021222 |
4 | 200301032122222003013033 |
5 | 122342231203404100333 |
6 | 1230303525514513555 |
7 | 42233225314201016 |
oct | 4061163252030717 |
9 | 626252432413258 |
10 | 144120222331343 |
11 | 41a15052332845 |
12 | 141b756aa358bb |
13 | 625562b7990ab |
14 | 27836552c9a7d |
15 | 119dd6ec18298 |
hex | 83139aa831cf |
144120222331343 has 8 divisors (see below), whose sum is σ = 144314307253056. Its totient is φ = 143926216106400.
The previous prime is 144120222331213. The next prime is 144120222331357. The reversal of 144120222331343 is 343133222021441.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144120222331343 - 220 = 144120221282767 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 (144120222331373) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16008596 + ... + 23334857.
It is an arithmetic number, because the mean of its divisors is an integer number (18039288406632).
Almost surely, 2144120222331343 is an apocalyptic number.
144120222331343 is a deficient number, since it is larger than the sum of its proper divisors (194084921713).
144120222331343 is an equidigital number, since it uses as much as digits as its factorization.
144120222331343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39348385.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 144120222331343 its reverse (343133222021441), we get a palindrome (487253444352784).
The spelling of 144120222331343 in words is "one hundred forty-four trillion, one hundred twenty billion, two hundred twenty-two million, three hundred thirty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •