Base | Representation |
---|---|
bin | 110000011100101000… |
… | …1111000111111011100 |
3 | 100221112202000002101002 |
4 | 1200321101320333130 |
5 | 3201033243100200 |
6 | 115443450405432 |
7 | 10342133106422 |
oct | 1407121707734 |
9 | 327482002332 |
10 | 104040206300 |
11 | 40139a90978 |
12 | 181b6a30878 |
13 | 9a7086a864 |
14 | 506d87d112 |
15 | 2a8dca2bd5 |
hex | 1839478fdc |
104040206300 has 108 divisors (see below), whose sum is σ = 230422298904. Its totient is φ = 40774377600.
The previous prime is 104040206243. The next prime is 104040206351. The reversal of 104040206300 is 3602040401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 101899790 + ... + 101900810.
Almost surely, 2104040206300 is an apocalyptic number.
104040206300 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 104040206300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115211149452).
104040206300 is an abundant number, since it is smaller than the sum of its proper divisors (126382092604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104040206300 is a wasteful number, since it uses less digits than its factorization.
104040206300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1396 (or 1322 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 104040206300 its reverse (3602040401), we get a palindrome (107642246701).
The spelling of 104040206300 in words is "one hundred four billion, forty million, two hundred six thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •