Base | Representation |
---|---|
bin | 10001001111011… |
… | …10010011100000 |
3 | 101002011000110000 |
4 | 20213232103200 |
5 | 244011143013 |
6 | 22203540000 |
7 | 3404225514 |
oct | 1047562340 |
9 | 332130400 |
10 | 144631008 |
11 | 74705465 |
12 | 4052a600 |
13 | 23c6c1a2 |
14 | 152cc144 |
15 | ca6d973 |
hex | 89ee4e0 |
144631008 has 60 divisors (see below), whose sum is σ = 425363400. Its totient is φ = 48209472.
The previous prime is 144630991. The next prime is 144631009. The reversal of 144631008 is 800136441.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144631009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 25308 + ... + 30491.
It is an arithmetic number, because the mean of its divisors is an integer number (7089390).
Almost surely, 2144631008 is an apocalyptic number.
144631008 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
144631008 is an abundant number, since it is smaller than the sum of its proper divisors (280732392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144631008 is an equidigital number, since it uses as much as digits as its factorization.
144631008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55821 (or 55804 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 144631008 is about 12026.2632600488. The cubic root of 144631008 is about 524.9127691805.
Adding to 144631008 its reverse (800136441), we get a palindrome (944767449).
The spelling of 144631008 in words is "one hundred forty-four million, six hundred thirty-one thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •