Base | Representation |
---|---|
bin | 110000101011010001… |
… | …0100101110011010100 |
3 | 100222210221202021001100 |
4 | 1201112202211303110 |
5 | 3203034431422122 |
6 | 120004304430100 |
7 | 10360243613562 |
oct | 1412642456324 |
9 | 328727667040 |
10 | 104531123412 |
11 | 403711041a1 |
12 | 18313318330 |
13 | 9b1b492661 |
14 | 50b8b4ca32 |
15 | 2abbe24aac |
hex | 18568a5cd4 |
104531123412 has 72 divisors (see below), whose sum is σ = 265057228800. Its totient is φ = 34734997440.
The previous prime is 104531123399. The next prime is 104531123441. The reversal of 104531123412 is 214321135401.
104531123412 is a `hidden beast` number, since 1 + 0 + 4 + 5 + 311 + 2 + 341 + 2 = 666.
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 23 ways as a sum of consecutive naturals, for example, 16665837 + ... + 16672107.
It is an arithmetic number, because the mean of its divisors is an integer number (3681350400).
Almost surely, 2104531123412 is an apocalyptic number.
104531123412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104531123412 is an abundant number, since it is smaller than the sum of its proper divisors (160526105388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104531123412 is a wasteful number, since it uses less digits than its factorization.
104531123412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7653 (or 7648 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 104531123412 its reverse (214321135401), we get a palindrome (318852258813).
The spelling of 104531123412 in words is "one hundred four billion, five hundred thirty-one million, one hundred twenty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •