Base | Representation |
---|---|
bin | 10001101010110000011… |
… | …001011001001011100101 |
3 | 11022001220112000221000221 |
4 | 101222300121121023211 |
5 | 124343024344133404 |
6 | 2325433542404341 |
7 | 153501345424402 |
oct | 21526031311345 |
9 | 4261815027027 |
10 | 1214140224229 |
11 | 428a0655a919 |
12 | 1773851306b1 |
13 | 8a653c81caa |
14 | 42a9c4a32a9 |
15 | 218b12bb954 |
hex | 11ab06592e5 |
1214140224229 has 2 divisors, whose sum is σ = 1214140224230. Its totient is φ = 1214140224228.
The previous prime is 1214140224221. The next prime is 1214140224251. The reversal of 1214140224229 is 9224220414121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1076981101729 + 137159122500 = 1037777^2 + 370350^2 .
It is a cyclic number.
It is not a de Polignac number, because 1214140224229 - 23 = 1214140224221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1214140224194 and 1214140224203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1214140224221) 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, 607070112114 + 607070112115.
It is an arithmetic number, because the mean of its divisors is an integer number (607070112115).
Almost surely, 21214140224229 is an apocalyptic number.
It is an amenable number.
1214140224229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214140224229 is an equidigital number, since it uses as much as digits as its factorization.
1214140224229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 34.
The spelling of 1214140224229 in words is "one trillion, two hundred fourteen billion, one hundred forty million, two hundred twenty-four thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •