Base | Representation |
---|---|
bin | 1100001101010… |
… | …00100001100000 |
3 | 21010200120100000 |
4 | 12012220201200 |
5 | 202203332034 |
6 | 14054500000 |
7 | 2352255345 |
oct | 606504140 |
9 | 233616300 |
10 | 102402144 |
11 | 52892279 |
12 | 2a364600 |
13 | 182a4cb0 |
14 | d8587cc |
15 | 8ecb599 |
hex | 61a8860 |
102402144 has 144 divisors (see below), whose sum is σ = 325542672. Its totient is φ = 31477248.
The previous prime is 102402127. The next prime is 102402193. The reversal of 102402144 is 441204201.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 100582 + ... + 101594.
It is an arithmetic number, because the mean of its divisors is an integer number (2260713).
Almost surely, 2102402144 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 102402144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162771336).
102402144 is an abundant number, since it is smaller than the sum of its proper divisors (223140528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102402144 is a wasteful number, since it uses less digits than its factorization.
102402144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1051 (or 1031 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
The square root of 102402144 is about 10119.3944482859. The cubic root of 102402144 is about 467.8461032444.
Adding to 102402144 its reverse (441204201), we get a palindrome (543606345).
The spelling of 102402144 in words is "one hundred two million, four hundred two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •