Base | Representation |
---|---|
bin | 10001001011011… |
… | …01001001110000 |
3 | 101001011010210010 |
4 | 20211231021300 |
5 | 243342231000 |
6 | 22144334520 |
7 | 3366563310 |
oct | 1045551160 |
9 | 331133703 |
10 | 144102000 |
11 | 74383a69 |
12 | 40314440 |
13 | 23b15473 |
14 | 151d1440 |
15 | c9b6d50 |
hex | 896d270 |
144102000 has 320 divisors, whose sum is σ = 549679104. Its totient is φ = 31795200.
The previous prime is 144101999. The next prime is 144102019. The reversal of 144102000 is 201441.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1973964 + ... + 1974036.
Almost surely, 2144102000 is an apocalyptic number.
144102000 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 144102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274839552).
144102000 is an abundant number, since it is smaller than the sum of its proper divisors (405577104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144102000 is a wasteful number, since it uses less digits than its factorization.
144102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153 (or 137 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 144102000 is about 12004.2492476623. The cubic root of 144102000 is about 524.2720068653.
Adding to 144102000 its reverse (201441), we get a palindrome (144303441).
It can be divided in two parts, 14 and 4102000, that added together give a palindrome (4102014).
The spelling of 144102000 in words is "one hundred forty-four million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •