Base | Representation |
---|---|
bin | 110000011111101111… |
… | …1000010001101000000 |
3 | 100221210222220100221021 |
4 | 1200333133002031000 |
5 | 3201241421041300 |
6 | 115502050035224 |
7 | 10344536034052 |
oct | 1407737021500 |
9 | 327728810837 |
10 | 104144315200 |
11 | 40192829492 |
12 | 18225878b14 |
13 | 9a892bc663 |
14 | 507d61d8d2 |
15 | 2a97eb9d1a |
hex | 183f7c2340 |
104144315200 has 42 divisors (see below), whose sum is σ = 256260109526. Its totient is φ = 41657725440.
The previous prime is 104144315173. The next prime is 104144315221. The reversal of 104144315200 is 2513441401.
It can be written as a sum of positive squares in 3 ways, for example, as 130325056 + 104013990144 = 11416^2 + 322512^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 32543499 + ... + 32546698.
Almost surely, 2104144315200 is an apocalyptic number.
104144315200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104144315200 is an abundant number, since it is smaller than the sum of its proper divisors (152115794326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104144315200 is an equidigital number, since it uses as much as digits as its factorization.
104144315200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65090219 (or 65090204 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 104144315200 its reverse (2513441401), we get a palindrome (106657756601).
The spelling of 104144315200 in words is "one hundred four billion, one hundred forty-four million, three hundred fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •