Base | Representation |
---|---|
bin | 10011001001010101101110… |
… | …01001101011000001011001 |
3 | 12112001221111121200100212111 |
4 | 21210222313021223001121 |
5 | 21004301044100421213 |
6 | 225313314325512321 |
7 | 11603536200645643 |
oct | 1144526711530131 |
9 | 175057447610774 |
10 | 42102342201433 |
11 | 12462559626618 |
12 | 487b8712726a1 |
13 | 1a6530696b277 |
14 | a57a9b0c1893 |
15 | 4d02a288ea3d |
hex | 264ab726b059 |
42102342201433 has 2 divisors, whose sum is σ = 42102342201434. Its totient is φ = 42102342201432.
The previous prime is 42102342201397. The next prime is 42102342201443. The reversal of 42102342201433 is 33410224320124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34901722741824 + 7200619459609 = 5907768^2 + 2683397^2 .
It is a cyclic number.
It is not a de Polignac number, because 42102342201433 - 229 = 42101805330521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42102342201395 and 42102342201404.
It is not a weakly prime, because it can be changed into another prime (42102342201443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21051171100716 + 21051171100717.
It is an arithmetic number, because the mean of its divisors is an integer number (21051171100717).
Almost surely, 242102342201433 is an apocalyptic number.
It is an amenable number.
42102342201433 is a deficient number, since it is larger than the sum of its proper divisors (1).
42102342201433 is an equidigital number, since it uses as much as digits as its factorization.
42102342201433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 42102342201433 its reverse (33410224320124), we get a palindrome (75512566521557).
The spelling of 42102342201433 in words is "forty-two trillion, one hundred two billion, three hundred forty-two million, two hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •