Base | Representation |
---|---|
bin | 10111101101111011100011… |
… | …111100011100100010001001 |
3 | 111200100001221211002111020112 |
4 | 113231323203330130202021 |
5 | 102133014221401233301 |
6 | 1005503555020004105 |
7 | 30654151506526136 |
oct | 2755734374344211 |
9 | 450301854074215 |
10 | 104311400024201 |
11 | 30267241a14a47 |
12 | b8482b8990635 |
13 | 46286a4817216 |
14 | 1ba89ad33358d |
15 | c0d5a3b939bb |
hex | 5edee3f1c889 |
104311400024201 has 2 divisors, whose sum is σ = 104311400024202. Its totient is φ = 104311400024200.
The previous prime is 104311400024189. The next prime is 104311400024203. The reversal of 104311400024201 is 102420004113401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101620996364176 + 2690403660025 = 10080724^2 + 1640245^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104311400024201 is a prime.
Together with 104311400024203, 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 (104311400024203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52155700012100 + 52155700012101.
It is an arithmetic number, because the mean of its divisors is an integer number (52155700012101).
Almost surely, 2104311400024201 is an apocalyptic number.
It is an amenable number.
104311400024201 is a deficient number, since it is larger than the sum of its proper divisors (1).
104311400024201 is an equidigital number, since it uses as much as digits as its factorization.
104311400024201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 104311400024201 its reverse (102420004113401), we get a palindrome (206731404137602).
The spelling of 104311400024201 in words is "one hundred four trillion, three hundred eleven billion, four hundred million, twenty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •