Base | Representation |
---|---|
bin | 110000101111110000… |
… | …0100101010001110001 |
3 | 101000012102212212001002 |
4 | 1201133200211101301 |
5 | 3203341441420141 |
6 | 120031241451345 |
7 | 10364051564354 |
oct | 1413740452161 |
9 | 330172785032 |
10 | 104681591921 |
11 | 40439036435 |
12 | 183557a0b55 |
13 | 9b436c688a |
14 | 50d0b1a29b |
15 | 2aca247e9b |
hex | 185f825471 |
104681591921 has 2 divisors, whose sum is σ = 104681591922. Its totient is φ = 104681591920.
The previous prime is 104681591887. The next prime is 104681591923. The reversal of 104681591921 is 129195186401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94310410000 + 10371181921 = 307100^2 + 101839^2 .
It is a cyclic number.
It is not a de Polignac number, because 104681591921 - 230 = 103607850097 is a prime.
It is a super-2 number, since 2×1046815919212 (a number of 23 digits) contains 22 as substring.
Together with 104681591923, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (104681591923) 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 as a sum of consecutive naturals, namely, 52340795960 + 52340795961.
It is an arithmetic number, because the mean of its divisors is an integer number (52340795961).
Almost surely, 2104681591921 is an apocalyptic number.
It is an amenable number.
104681591921 is a deficient number, since it is larger than the sum of its proper divisors (1).
104681591921 is an equidigital number, since it uses as much as digits as its factorization.
104681591921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 47.
The spelling of 104681591921 in words is "one hundred four billion, six hundred eighty-one million, five hundred ninety-one thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •