Base | Representation |
---|---|
bin | 10100110111101001100… |
… | …001101111000000111101 |
3 | 12002002202211021100100012 |
4 | 110313221201233000331 |
5 | 141444110330403341 |
6 | 3014500305113005 |
7 | 205420243145405 |
oct | 24675141570075 |
9 | 5062684240305 |
10 | 1434142044221 |
11 | 503241883467 |
12 | 1b1b43328765 |
13 | a53151652c3 |
14 | 4d5acbc1805 |
15 | 2748a71b0eb |
hex | 14de986f03d |
1434142044221 has 2 divisors, whose sum is σ = 1434142044222. Its totient is φ = 1434142044220.
The previous prime is 1434142044169. The next prime is 1434142044227. The reversal of 1434142044221 is 1224402414341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1422652562500 + 11489481721 = 1192750^2 + 107189^2 .
It is an emirp because it is prime and its reverse (1224402414341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1434142044221 - 222 = 1434137849917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1434142044227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 717071022110 + 717071022111.
It is an arithmetic number, because the mean of its divisors is an integer number (717071022111).
Almost surely, 21434142044221 is an apocalyptic number.
It is an amenable number.
1434142044221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1434142044221 is an equidigital number, since it uses as much as digits as its factorization.
1434142044221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 1434142044221 its reverse (1224402414341), we get a palindrome (2658544458562).
The spelling of 1434142044221 in words is "one trillion, four hundred thirty-four billion, one hundred forty-two million, forty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •