Base | Representation |
---|---|
bin | 110000011011110111… |
… | …0000000100111001001 |
3 | 100221110220201211210102 |
4 | 1200313232000213021 |
5 | 3201010042214423 |
6 | 115441113255145 |
7 | 10341364415540 |
oct | 1406756004711 |
9 | 327426654712 |
10 | 104014023113 |
11 | 40126228080 |
12 | 181aa1044b5 |
13 | 9a68300c50 |
14 | 506a1c5157 |
15 | 2a8b82ec28 |
hex | 1837b809c9 |
104014023113 has 128 divisors (see below), whose sum is σ = 150897696768. Its totient is φ = 69062400000.
The previous prime is 104014023109. The next prime is 104014023143. The reversal of 104014023113 is 311320410401.
It is not a de Polignac number, because 104014023113 - 22 = 104014023109 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104014023103) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 95337698 + ... + 95338788.
It is an arithmetic number, because the mean of its divisors is an integer number (1178888256).
Almost surely, 2104014023113 is an apocalyptic number.
104014023113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
104014023113 is a deficient number, since it is larger than the sum of its proper divisors (46883673655).
104014023113 is a wasteful number, since it uses less digits than its factorization.
104014023113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1287.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 104014023113 its reverse (311320410401), we get a palindrome (415334433514).
The spelling of 104014023113 in words is "one hundred four billion, fourteen million, twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •