Base | Representation |
---|---|
bin | 10001001111000… |
… | …00001001100110 |
3 | 101002001001220200 |
4 | 20213200021212 |
5 | 244002314110 |
6 | 22202411330 |
7 | 3403564500 |
oct | 1047401146 |
9 | 332031820 |
10 | 144573030 |
11 | 74675948 |
12 | 40500b46 |
13 | 23c4b994 |
14 | 152b4d70 |
15 | ca5b6c0 |
hex | 89e0266 |
144573030 has 72 divisors (see below), whose sum is σ = 437272992. Its totient is φ = 33044256.
The previous prime is 144572993. The next prime is 144573031. The reversal of 144573030 is 30375441.
It is a super-2 number, since 2×1445730302 = 41802722006761800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144572985 and 144573003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144573031) by changing a digit.
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 35 ways as a sum of consecutive naturals, for example, 11982 + ... + 20801.
It is an arithmetic number, because the mean of its divisors is an integer number (6073236).
Almost surely, 2144573030 is an apocalyptic number.
144573030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144573030 is an abundant number, since it is smaller than the sum of its proper divisors (292699962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144573030 is a wasteful number, since it uses less digits than its factorization.
144573030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32810 (or 32800 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 144573030 is about 12023.8525440060. The cubic root of 144573030 is about 524.8426194930.
The spelling of 144573030 in words is "one hundred forty-four million, five hundred seventy-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •