Base | Representation |
---|---|
bin | 10001001101011… |
… | …11000100100000 |
3 | 101001122212011010 |
4 | 20212233010200 |
5 | 243424401000 |
6 | 22154220520 |
7 | 3402066423 |
oct | 1046570440 |
9 | 331585133 |
10 | 144372000 |
11 | 74548903 |
12 | 40424740 |
13 | 23bab326 |
14 | 152619ba |
15 | ca1bd50 |
hex | 89af120 |
144372000 has 192 divisors, whose sum is σ = 484009344. Its totient is φ = 37606400.
The previous prime is 144371999. The next prime is 144372043. The reversal of 144372000 is 273441.
144372000 is nontrivially palindromic in base 9.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 635887 + ... + 636113.
It is an arithmetic number, because the mean of its divisors is an integer number (2520882).
Almost surely, 2144372000 is an apocalyptic number.
144372000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144372000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (242004672).
144372000 is an abundant number, since it is smaller than the sum of its proper divisors (339637344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144372000 is a wasteful number, since it uses less digits than its factorization.
144372000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308 (or 290 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 21.
The square root of 144372000 is about 12015.4900024926. The cubic root of 144372000 is about 524.5992406430.
The spelling of 144372000 in words is "one hundred forty-four million, three hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •