Base | Representation |
---|---|
bin | 10001001110001… |
… | …11101011000010 |
3 | 101001211222101100 |
4 | 20213013223002 |
5 | 243441112040 |
6 | 22200315230 |
7 | 3402666261 |
oct | 1047075302 |
9 | 331758340 |
10 | 144472770 |
11 | 74607592 |
12 | 40472b16 |
13 | 23c15160 |
14 | 1528a5d8 |
15 | ca3bb30 |
hex | 89c7ac2 |
144472770 has 192 divisors, whose sum is σ = 436625280. Its totient is φ = 32845824.
The previous prime is 144472747. The next prime is 144472777. The reversal of 144472770 is 77274441.
It is not an unprimeable number, because it can be changed into a prime (144472777) 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 95 ways as a sum of consecutive naturals, for example, 1489362 + ... + 1489458.
It is an arithmetic number, because the mean of its divisors is an integer number (2274090).
Almost surely, 2144472770 is an apocalyptic number.
144472770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 144472770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218312640).
144472770 is an abundant number, since it is smaller than the sum of its proper divisors (292152510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144472770 is a wasteful number, since it uses less digits than its factorization.
144472770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209 (or 206 counting only the distinct ones).
The product of its (nonzero) digits is 43904, while the sum is 36.
The square root of 144472770 is about 12019.6826081224. The cubic root of 144472770 is about 524.7212670073.
The spelling of 144472770 in words is "one hundred forty-four million, four hundred seventy-two thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.222 sec. • engine limits •