Base | Representation |
---|---|
bin | 10010110100100000… |
… | …00110010010110000 |
3 | 222002011122200010020 |
4 | 21122100012102300 |
5 | 131143122312422 |
6 | 4350342003440 |
7 | 505250316324 |
oct | 113220062260 |
9 | 28064580106 |
10 | 10104104112 |
11 | 4315559a73 |
12 | 1b5ba16580 |
13 | c5043a03b |
14 | 6bbd01984 |
15 | 3e20c395c |
hex | 25a4064b0 |
10104104112 has 20 divisors (see below), whose sum is σ = 26102269080. Its totient is φ = 3368034688.
The previous prime is 10104104093. The next prime is 10104104113. The reversal of 10104104112 is 21140140101.
It is a super-2 number, since 2×101041041122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10104104091 and 10104104100.
It is not an unprimeable number, because it can be changed into a prime (10104104113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105251037 + ... + 105251132.
It is an arithmetic number, because the mean of its divisors is an integer number (1305113454).
Almost surely, 210104104112 is an apocalyptic number.
10104104112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10104104112 is an abundant number, since it is smaller than the sum of its proper divisors (15998164968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10104104112 is a wasteful number, since it uses less digits than its factorization.
10104104112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210502180 (or 210502174 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10104104112 its reverse (21140140101), we get a palindrome (31244244213).
The spelling of 10104104112 in words is "ten billion, one hundred four million, one hundred four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •