Base | Representation |
---|---|
bin | 101111100101001110… |
… | …1100110010100111100 |
3 | 100202202011120212010000 |
4 | 1133022131212110330 |
5 | 3133231314121404 |
6 | 114535153314300 |
7 | 10245066131340 |
oct | 1371235462474 |
9 | 322664525100 |
10 | 102181004604 |
11 | 3a375571148 |
12 | 17978265990 |
13 | 9835620003 |
14 | 4d34995620 |
15 | 29d0953339 |
hex | 17ca76653c |
102181004604 has 120 divisors (see below), whose sum is σ = 306729788288. Its totient is φ = 29056073760.
The previous prime is 102181004587. The next prime is 102181004617. The reversal of 102181004604 is 406400181201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 371787 + ... + 585309.
Almost surely, 2102181004604 is an apocalyptic number.
102181004604 is a gapful number since it is divisible by the number (14) 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 102181004604, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153364894144).
102181004604 is an abundant number, since it is smaller than the sum of its proper divisors (204548783684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102181004604 is a wasteful number, since it uses less digits than its factorization.
102181004604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213757 (or 213746 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 102181004604 its reverse (406400181201), we get a palindrome (508581185805).
The spelling of 102181004604 in words is "one hundred two billion, one hundred eighty-one million, four thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •