Base | Representation |
---|---|
bin | 110000100001011100… |
… | …0100000001001111011 |
3 | 100221221222011200010010 |
4 | 1201002320200021323 |
5 | 3201401014320011 |
6 | 115511443553003 |
7 | 10346130426663 |
oct | 1410270401173 |
9 | 327858150103 |
10 | 104201323131 |
11 | 40211a26384 |
12 | 1824098b763 |
13 | 9a9805c769 |
14 | 508701d1a3 |
15 | 2a9cecb1a6 |
hex | 1842e2027b |
104201323131 has 16 divisors (see below), whose sum is σ = 139324839584. Its totient is φ = 69272838144.
The previous prime is 104201323129. The next prime is 104201323133. The reversal of 104201323131 is 131323102401.
It is an interprime number because it is at equal distance from previous prime (104201323129) and next prime (104201323133).
It is not a de Polignac number, because 104201323131 - 21 = 104201323129 is a prime.
It is a super-2 number, since 2×1042013231312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104201323098 and 104201323107.
It is not an unprimeable number, because it can be changed into a prime (104201323133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2757195 + ... + 2794731.
It is an arithmetic number, because the mean of its divisors is an integer number (8707802474).
Almost surely, 2104201323131 is an apocalyptic number.
104201323131 is a deficient number, since it is larger than the sum of its proper divisors (35123516453).
104201323131 is a wasteful number, since it uses less digits than its factorization.
104201323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40110.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 104201323131 its reverse (131323102401), we get a palindrome (235524425532).
The spelling of 104201323131 in words is "one hundred four billion, two hundred one million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •