Base | Representation |
---|---|
bin | 100000110111011000010011… |
… | …001000000010101110110111 |
3 | 200221210012010122222000202121 |
4 | 200313120103020002232313 |
5 | 122421143332431130111 |
6 | 1231230112340020411 |
7 | 42305620003216423 |
oct | 4067302310025667 |
9 | 627705118860677 |
10 | 144543150255031 |
11 | 420684510a5600 |
12 | 14265520691707 |
13 | 628648c27b988 |
14 | 2799cd6577b83 |
15 | 11a9d74435871 |
hex | 837613202bb7 |
144543150255031 has 48 divisors (see below), whose sum is σ = 174522756280320. Its totient is φ = 119066640897600.
The previous prime is 144543150255019. The next prime is 144543150255047. The reversal of 144543150255031 is 130552051345441.
It is not a de Polignac number, because 144543150255031 - 213 = 144543150246839 is a prime.
It is a super-2 number, since 2×1445431502550312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144543150255061) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 889891581 + ... + 890053993.
It is an arithmetic number, because the mean of its divisors is an integer number (3635890755840).
Almost surely, 2144543150255031 is an apocalyptic number.
144543150255031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
144543150255031 is a deficient number, since it is larger than the sum of its proper divisors (29979606025289).
144543150255031 is a wasteful number, since it uses less digits than its factorization.
144543150255031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179308 (or 179297 counting only the distinct ones).
The product of its (nonzero) digits is 720000, while the sum is 43.
The spelling of 144543150255031 in words is "one hundred forty-four trillion, five hundred forty-three billion, one hundred fifty million, two hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •