Base | Representation |
---|---|
bin | 110000011011110011… |
… | …0101011100111101100 |
3 | 100221110210010020200200 |
4 | 1200313212223213230 |
5 | 3201004044231444 |
6 | 115441004153500 |
7 | 10341342165150 |
oct | 1406746534754 |
9 | 327423106620 |
10 | 104012102124 |
11 | 40125135887 |
12 | 181a9538890 |
13 | 9a67aaa778 |
14 | 5069c45060 |
15 | 2a8b5a0969 |
hex | 18379ab9ec |
104012102124 has 72 divisors (see below), whose sum is σ = 301345594368. Its totient is φ = 29632076640.
The previous prime is 104012102113. The next prime is 104012102149. The reversal of 104012102124 is 421201210401.
104012102124 is a `hidden beast` number, since 10 + 401 + 210 + 21 + 24 = 666.
It is a super-2 number, since 2×1040121021242 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 104012102097 and 104012102106.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 507292 + ... + 682179.
Almost surely, 2104012102124 is an apocalyptic number.
104012102124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
104012102124 is an abundant number, since it is smaller than the sum of its proper divisors (197333492244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104012102124 is a wasteful number, since it uses less digits than its factorization.
104012102124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1189835 (or 1189830 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 104012102124 its reverse (421201210401), we get a palindrome (525213312525).
The spelling of 104012102124 in words is "one hundred four billion, twelve million, one hundred two thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •