Base | Representation |
---|---|
bin | 111101101111111001110… |
… | …101010001011111111001 |
3 | 120000122202120010110012222 |
4 | 331233321311101133321 |
5 | 1024010311444310431 |
6 | 13005204540213425 |
7 | 615366346460531 |
oct | 75577165213771 |
9 | 16018676113188 |
10 | 4243324213241 |
11 | 1396646993483 |
12 | 58647483a275 |
13 | 24a1b3aa9539 |
14 | 1095412ac4c1 |
15 | 755a2b9d57b |
hex | 3dbf9d517f9 |
4243324213241 has 2 divisors, whose sum is σ = 4243324213242. Its totient is φ = 4243324213240.
The previous prime is 4243324213207. The next prime is 4243324213411. The reversal of 4243324213241 is 1423124233424.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2613463457641 + 1629860755600 = 1616621^2 + 1276660^2 .
It is a cyclic number.
It is not a de Polignac number, because 4243324213241 - 214 = 4243324196857 is a prime.
It is not a weakly prime, because it can be changed into another prime (4243324215241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2121662106620 + 2121662106621.
It is an arithmetic number, because the mean of its divisors is an integer number (2121662106621).
Almost surely, 24243324213241 is an apocalyptic number.
It is an amenable number.
4243324213241 is a deficient number, since it is larger than the sum of its proper divisors (1).
4243324213241 is an equidigital number, since it uses as much as digits as its factorization.
4243324213241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 110592, while the sum is 35.
Adding to 4243324213241 its reverse (1423124233424), we get a palindrome (5666448446665).
The spelling of 4243324213241 in words is "four trillion, two hundred forty-three billion, three hundred twenty-four million, two hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •