Base | Representation |
---|---|
bin | 110000110000010110… |
… | …1001111101111111111 |
3 | 101000020211200212211002 |
4 | 1201200231033233333 |
5 | 3203412113020311 |
6 | 120033240320515 |
7 | 10364414446055 |
oct | 1414055175777 |
9 | 330224625732 |
10 | 104701688831 |
11 | 40449412553 |
12 | 1836047313b |
13 | 9b4791213c |
14 | 50d366c1d5 |
15 | 2acbdb793b |
hex | 1860b4fbff |
104701688831 has 4 divisors (see below), whose sum is σ = 104703074952. Its totient is φ = 104700302712.
The previous prime is 104701688813. The next prime is 104701688851. The reversal of 104701688831 is 138886107401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 138886107401 = 15137 ⋅9175273.
It is a cyclic number.
It is not a de Polignac number, because 104701688831 - 210 = 104701687807 is a prime.
It is a super-2 number, since 2×1047016888312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104701688851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 572801 + ... + 733146.
It is an arithmetic number, because the mean of its divisors is an integer number (26175768738).
Almost surely, 2104701688831 is an apocalyptic number.
104701688831 is a deficient number, since it is larger than the sum of its proper divisors (1386121).
104701688831 is an equidigital number, since it uses as much as digits as its factorization.
104701688831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1386120.
The product of its (nonzero) digits is 258048, while the sum is 47.
The spelling of 104701688831 in words is "one hundred four billion, seven hundred one million, six hundred eighty-eight thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •