Base | Representation |
---|---|
bin | 110000101000000111… |
… | …1010100111010011000 |
3 | 100222112120211110210012 |
4 | 1201100033110322120 |
5 | 3202330401111300 |
6 | 115550010541052 |
7 | 10354521225026 |
oct | 1412017247230 |
9 | 328476743705 |
10 | 104425410200 |
11 | 40317470301 |
12 | 182a3a37788 |
13 | 9b025cb567 |
14 | 50a8ab1716 |
15 | 2ab29e2435 |
hex | 18503d4e98 |
104425410200 has 24 divisors (see below), whose sum is σ = 242789079180. Its totient is φ = 41770164000.
The previous prime is 104425410197. The next prime is 104425410203. The reversal of 104425410200 is 2014524401.
It is an interprime number because it is at equal distance from previous prime (104425410197) and next prime (104425410203).
It is a super-3 number, since 3×1044254102003 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104425410203) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 261063326 + ... + 261063725.
Almost surely, 2104425410200 is an apocalyptic number.
104425410200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104425410200 is an abundant number, since it is smaller than the sum of its proper divisors (138363668980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104425410200 is a wasteful number, since it uses less digits than its factorization.
104425410200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 522127067 (or 522127058 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 23.
Adding to 104425410200 its reverse (2014524401), we get a palindrome (106439934601).
The spelling of 104425410200 in words is "one hundred four billion, four hundred twenty-five million, four hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •