Base | Representation |
---|---|
bin | 100001000100011110011110… |
… | …001010101011100011100110 |
3 | 201001222020010212210012011121 |
4 | 201010132132022223203212 |
5 | 123030420013033110142 |
6 | 1233155352501524154 |
7 | 42430630242444046 |
oct | 4104363612534346 |
9 | 631866125705147 |
10 | 145443131144422 |
11 | 423850a3922301 |
12 | 1438ba2a41365a |
13 | 63202c7aa6417 |
14 | 27cb6b11c7726 |
15 | 11c3499e39c67 |
hex | 84479e2ab8e6 |
145443131144422 has 8 divisors (see below), whose sum is σ = 218164865605272. Its totient is φ = 72721509276000.
The previous prime is 145443131144417. The next prime is 145443131144431. The reversal of 145443131144422 is 224441131344541.
145443131144422 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
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, 24840979 + ... + 30132382.
It is an arithmetic number, because the mean of its divisors is an integer number (27270608200659).
Almost surely, 2145443131144422 is an apocalyptic number.
145443131144422 is a deficient number, since it is larger than the sum of its proper divisors (72721734460850).
145443131144422 is a wasteful number, since it uses less digits than its factorization.
145443131144422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56296214.
The product of its digits is 737280, while the sum is 43.
Adding to 145443131144422 its reverse (224441131344541), we get a palindrome (369884262488963).
The spelling of 145443131144422 in words is "one hundred forty-five trillion, four hundred forty-three billion, one hundred thirty-one million, one hundred forty-four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •