Base | Representation |
---|---|
bin | 10001001100101… |
… | …10001111011100 |
3 | 101001110200122110 |
4 | 20212112033130 |
5 | 243413122200 |
6 | 22152114020 |
7 | 3401164056 |
oct | 1046261734 |
9 | 331420573 |
10 | 144270300 |
11 | 74489459 |
12 | 40395910 |
13 | 23b73c55 |
14 | 152368d6 |
15 | c9ebb50 |
hex | 89963dc |
144270300 has 72 divisors (see below), whose sum is σ = 420723072. Its totient is φ = 38168000.
The previous prime is 144270223. The next prime is 144270317. The reversal of 144270300 is 3072441.
144270300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37465 + ... + 41135.
It is an arithmetic number, because the mean of its divisors is an integer number (5843376).
Almost surely, 2144270300 is an apocalyptic number.
144270300 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 144270300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210361536).
144270300 is an abundant number, since it is smaller than the sum of its proper divisors (276452772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144270300 is a wasteful number, since it uses less digits than its factorization.
144270300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3819 (or 3812 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 21.
The square root of 144270300 is about 12011.2572197918. The cubic root of 144270300 is about 524.4760305210.
The spelling of 144270300 in words is "one hundred forty-four million, two hundred seventy thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •