Base | Representation |
---|---|
bin | 10001001110010… |
… | …00001111100110 |
3 | 101001212002121000 |
4 | 20213020033212 |
5 | 243441200420 |
6 | 22200334130 |
7 | 3403006143 |
oct | 1047101746 |
9 | 331762530 |
10 | 144475110 |
11 | 7460931a |
12 | 40474346 |
13 | 23c16240 |
14 | 1528b3ca |
15 | ca3c690 |
hex | 89c83e6 |
144475110 has 64 divisors (see below), whose sum is σ = 414912960. Its totient is φ = 35562240.
The previous prime is 144475109. The next prime is 144475157. The reversal of 144475110 is 11574441.
144475110 is a `hidden beast` number, since 144 + 4 + 7 + 511 + 0 = 666.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 17071 + ... + 24090.
It is an arithmetic number, because the mean of its divisors is an integer number (6483015).
Almost surely, 2144475110 is an apocalyptic number.
144475110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144475110 is an abundant number, since it is smaller than the sum of its proper divisors (270437850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144475110 is a wasteful number, since it uses less digits than its factorization.
144475110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41190 (or 41184 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 144475110 is about 12019.7799480689. The cubic root of 144475110 is about 524.7240999313.
The spelling of 144475110 in words is "one hundred forty-four million, four hundred seventy-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •