Base | Representation |
---|---|
bin | 100000110110111001100011… |
… | …110111001001100001100100 |
3 | 200221200000221110211111211212 |
4 | 200312321203313021201210 |
5 | 122420123234112330112 |
6 | 1231203013311450552 |
7 | 42303341052435203 |
oct | 4066714367114144 |
9 | 627600843744755 |
10 | 144510145042532 |
11 | 42055454560985 |
12 | 1425b04b226a58 |
13 | 628332c3c8939 |
14 | 2798484d6b23a |
15 | 11a9091a88522 |
hex | 836e63dc9864 |
144510145042532 has 24 divisors (see below), whose sum is σ = 253998439685760. Its totient is φ = 71939165631840.
The previous prime is 144510145042493. The next prime is 144510145042537. The reversal of 144510145042532 is 235240541015441.
It is a self number, because there is not a number n which added to its sum of digits gives 144510145042532.
It is not an unprimeable number, because it can be changed into a prime (144510145042537) 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 7 ways as a sum of consecutive naturals, for example, 260408183 + ... + 260962529.
It is an arithmetic number, because the mean of its divisors is an integer number (10583268320240).
Almost surely, 2144510145042532 is an apocalyptic number.
It is an amenable number.
144510145042532 is a deficient number, since it is larger than the sum of its proper divisors (109488294643228).
144510145042532 is a wasteful number, since it uses less digits than its factorization.
144510145042532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839171 (or 839169 counting only the distinct ones).
The product of its (nonzero) digits is 384000, while the sum is 41.
Adding to 144510145042532 its reverse (235240541015441), we get a palindrome (379750686057973).
The spelling of 144510145042532 in words is "one hundred forty-four trillion, five hundred ten billion, one hundred forty-five million, forty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •