Base | Representation |
---|---|
bin | 100000110111100000100010… |
… | …100111101011111010011000 |
3 | 200221211000222102120220210002 |
4 | 200313200202213223322120 |
5 | 122421314444014034000 |
6 | 1231234134435512132 |
7 | 42306352214063162 |
oct | 4067404247537230 |
9 | 627730872526702 |
10 | 144552000143000 |
11 | 420711826883aa |
12 | 14267190458648 |
13 | 628726c8c1088 |
14 | 279a4d5a75932 |
15 | 11aa1e135e8d5 |
hex | 8378229ebe98 |
144552000143000 has 32 divisors (see below), whose sum is σ = 338251680336960. Its totient is φ = 57820800056800.
The previous prime is 144552000142987. The next prime is 144552000143093. The reversal of 144552000143000 is 341000255441.
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 7 ways as a sum of consecutive naturals, for example, 72275999072 + ... + 72276001071.
It is an arithmetic number, because the mean of its divisors is an integer number (10570365010530).
Almost surely, 2144552000143000 is an apocalyptic number.
144552000143000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
144552000143000 is an abundant number, since it is smaller than the sum of its proper divisors (193699680193960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144552000143000 is a wasteful number, since it uses less digits than its factorization.
144552000143000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144552000164 (or 144552000150 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 144552000143000 its reverse (341000255441), we get a palindrome (144893000398441).
The spelling of 144552000143000 in words is "one hundred forty-four trillion, five hundred fifty-two billion, one hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •