Base | Representation |
---|---|
bin | 10001010001010… |
… | …01001010000000 |
3 | 101002121021010000 |
4 | 20220221022000 |
5 | 244041401224 |
6 | 22213040000 |
7 | 3406251351 |
oct | 1050511200 |
9 | 332537100 |
10 | 144872064 |
11 | 7485a587 |
12 | 40626000 |
13 | 24024b1c |
14 | 15351d28 |
15 | caba0c9 |
hex | 8a29280 |
144872064 has 160 divisors (see below), whose sum is σ = 438758100. Its totient is φ = 47443968.
The previous prime is 144872053. The next prime is 144872069. The reversal of 144872064 is 460278441.
144872064 is a `hidden beast` number, since 1 + 448 + 7 + 206 + 4 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 134374464 + 10497600 = 11592^2 + 3240^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (144872069) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 922674 + ... + 922830.
Almost surely, 2144872064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144872064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219379050).
144872064 is an abundant number, since it is smaller than the sum of its proper divisors (293886036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144872064 is an equidigital number, since it uses as much as digits as its factorization.
144872064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272 (or 251 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 36.
The square root of 144872064 is about 12036.2811532466. The cubic root of 144872064 is about 525.2042307458.
The spelling of 144872064 in words is "one hundred forty-four million, eight hundred seventy-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •