Base | Representation |
---|---|
bin | 10111101111001111111101… |
… | …100101000010111111011100 |
3 | 111200122201212120212100011120 |
4 | 113233033331211002333130 |
5 | 102141010321222123400 |
6 | 1010013343343050540 |
7 | 30663540330231513 |
oct | 2757177545027734 |
9 | 450581776770146 |
10 | 104402024411100 |
11 | 302a1717030169 |
12 | b86198a8a0a50 |
13 | 46340b7ac31b0 |
14 | 1bad12912567a |
15 | c10b09c58ca0 |
hex | 5ef3fd942fdc |
104402024411100 has 144 divisors (see below), whose sum is σ = 325314797374560. Its totient is φ = 25698264883200.
The previous prime is 104402024411071. The next prime is 104402024411137. The reversal of 104402024411100 is 1114420204401.
It is a super-2 number, since 2×1044020244111002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 152104680 + ... + 152789520.
Almost surely, 2104402024411100 is an apocalyptic number.
104402024411100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104402024411100 is an abundant number, since it is smaller than the sum of its proper divisors (220912772963460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104402024411100 is a wasteful number, since it uses less digits than its factorization.
104402024411100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723960 (or 723953 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 104402024411100 its reverse (1114420204401), we get a palindrome (105516444615501).
The spelling of 104402024411100 in words is "one hundred four trillion, four hundred two billion, twenty-four million, four hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •