Base | Representation |
---|---|
bin | 111110111000010110001… |
… | …110111011111111000001 |
3 | 120022002112121000122101021 |
4 | 332320112032323333001 |
5 | 1031244113142123431 |
6 | 13105031322105441 |
7 | 624122064642154 |
oct | 76702616737701 |
9 | 16262477018337 |
10 | 4321110114241 |
11 | 1416633010178 |
12 | 59956304b281 |
13 | 25462c2b44ab |
14 | 10d1ddd79c9b |
15 | 77606ab7b11 |
hex | 3ee163bbfc1 |
4321110114241 has 2 divisors, whose sum is σ = 4321110114242. Its totient is φ = 4321110114240.
The previous prime is 4321110114197. The next prime is 4321110114259. The reversal of 4321110114241 is 1424110111234.
4321110114241 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2871804729600 + 1449305384641 = 1694640^2 + 1203871^2 .
It is a cyclic number.
It is not a de Polignac number, because 4321110114241 - 225 = 4321076559809 is a prime.
It is not a weakly prime, because it can be changed into another prime (4321110114271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2160555057120 + 2160555057121.
It is an arithmetic number, because the mean of its divisors is an integer number (2160555057121).
Almost surely, 24321110114241 is an apocalyptic number.
It is an amenable number.
4321110114241 is a deficient number, since it is larger than the sum of its proper divisors (1).
4321110114241 is an equidigital number, since it uses as much as digits as its factorization.
4321110114241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 4321110114241 its reverse (1424110111234), we get a palindrome (5745220225475).
The spelling of 4321110114241 in words is "four trillion, three hundred twenty-one billion, one hundred ten million, one hundred fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •