Base | Representation |
---|---|
bin | 10011010000000011111101… |
… | …00000100010111010010001 |
3 | 12112220000200212101212210201 |
4 | 21220001332200202322101 |
5 | 21022042114423131233 |
6 | 230011354144255201 |
7 | 11626324064646031 |
oct | 1150017640427221 |
9 | 175800625355721 |
10 | 42333320130193 |
11 | 1254150764a134 |
12 | 48b8593311501 |
13 | 1a81026b325b1 |
14 | a64d2d4518c1 |
15 | 4d62c070e77d |
hex | 26807e822e91 |
42333320130193 has 2 divisors, whose sum is σ = 42333320130194. Its totient is φ = 42333320130192.
The previous prime is 42333320130191. The next prime is 42333320130293. The reversal of 42333320130193 is 39103102333324.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42319487547649 + 13832582544 = 6505343^2 + 117612^2 .
It is a cyclic number.
It is not a de Polignac number, because 42333320130193 - 21 = 42333320130191 is a prime.
Together with 42333320130191, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (42333320130191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21166660065096 + 21166660065097.
It is an arithmetic number, because the mean of its divisors is an integer number (21166660065097).
Almost surely, 242333320130193 is an apocalyptic number.
It is an amenable number.
42333320130193 is a deficient number, since it is larger than the sum of its proper divisors (1).
42333320130193 is an equidigital number, since it uses as much as digits as its factorization.
42333320130193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 37.
The spelling of 42333320130193 in words is "forty-two trillion, three hundred thirty-three billion, three hundred twenty million, one hundred thirty thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •