Base | Representation |
---|---|
bin | 10101001111001100011001… |
… | …100001111000001010111101 |
3 | 110020201020200101102200121122 |
4 | 111033030121201320022331 |
5 | 44220304003004103331 |
6 | 530352441125240325 |
7 | 25450102306155422 |
oct | 2517143141701275 |
9 | 406636611380548 |
10 | 93403082097341 |
11 | 2784102a915615 |
12 | a5861872630a5 |
13 | 4016b468560b3 |
14 | 190ca3a235d49 |
15 | abe96637817b |
hex | 54f3198782bd |
93403082097341 has 2 divisors, whose sum is σ = 93403082097342. Its totient is φ = 93403082097340.
The previous prime is 93403082097301. The next prime is 93403082097343. The reversal of 93403082097341 is 14379028030439.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92664592800025 + 738489297316 = 9626245^2 + 859354^2 .
It is an emirp because it is prime and its reverse (14379028030439) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 93403082097341 - 226 = 93403014988477 is a prime.
Together with 93403082097343, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (93403082097343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46701541048670 + 46701541048671.
It is an arithmetic number, because the mean of its divisors is an integer number (46701541048671).
Almost surely, 293403082097341 is an apocalyptic number.
It is an amenable number.
93403082097341 is a deficient number, since it is larger than the sum of its proper divisors (1).
93403082097341 is an equidigital number, since it uses as much as digits as its factorization.
93403082097341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3919104, while the sum is 53.
The spelling of 93403082097341 in words is "ninety-three trillion, four hundred three billion, eighty-two million, ninety-seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •