Base | Representation |
---|---|
bin | 110101001111000010… |
… | …0100011100110011101 |
3 | 101221002020101211212122 |
4 | 1222132010203212131 |
5 | 3333112203103341 |
6 | 124303550512325 |
7 | 11154661456364 |
oct | 1523604434635 |
9 | 357066354778 |
10 | 114321144221 |
11 | 4453533a789 |
12 | 1a1a5b056a5 |
13 | aa1b81058b |
14 | 57670527db |
15 | 2e9165694b |
hex | 1a9e12399d |
114321144221 has 2 divisors, whose sum is σ = 114321144222. Its totient is φ = 114321144220.
The previous prime is 114321144211. The next prime is 114321144227. The reversal of 114321144221 is 122441123411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77145062500 + 37176081721 = 277750^2 + 192811^2 .
It is an emirp because it is prime and its reverse (122441123411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114321144221 - 234 = 97141275037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114321144227) 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, 57160572110 + 57160572111.
It is an arithmetic number, because the mean of its divisors is an integer number (57160572111).
Almost surely, 2114321144221 is an apocalyptic number.
It is an amenable number.
114321144221 is a deficient number, since it is larger than the sum of its proper divisors (1).
114321144221 is an equidigital number, since it uses as much as digits as its factorization.
114321144221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1536, while the sum is 26.
Adding to 114321144221 its reverse (122441123411), we get a palindrome (236762267632).
The spelling of 114321144221 in words is "one hundred fourteen billion, three hundred twenty-one million, one hundred forty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •