Base | Representation |
---|---|
bin | 10001001110011… |
… | …00101110010100 |
3 | 101001220000202122 |
4 | 20213030232110 |
5 | 243442242320 |
6 | 22200555112 |
7 | 3403113506 |
oct | 1047145624 |
9 | 331800678 |
10 | 144493460 |
11 | 74621091 |
12 | 40482a98 |
13 | 23c216b7 |
14 | 15293d76 |
15 | ca42d25 |
hex | 89ccb94 |
144493460 has 12 divisors (see below), whose sum is σ = 303436308. Its totient is φ = 57797376.
The previous prime is 144493417. The next prime is 144493477. The reversal of 144493460 is 64394441.
It can be written as a sum of positive squares in 2 ways, for example, as 33570436 + 110923024 = 5794^2 + 10532^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 144493460.
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 3 ways as a sum of consecutive naturals, for example, 3612317 + ... + 3612356.
It is an arithmetic number, because the mean of its divisors is an integer number (25286359).
Almost surely, 2144493460 is an apocalyptic number.
144493460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
144493460 is an abundant number, since it is smaller than the sum of its proper divisors (158942848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144493460 is a wasteful number, since it uses less digits than its factorization.
144493460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7224682 (or 7224680 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 35.
The square root of 144493460 is about 12020.5432489551. The cubic root of 144493460 is about 524.7463143219.
The spelling of 144493460 in words is "one hundred forty-four million, four hundred ninety-three thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •