Base | Representation |
---|---|
bin | 10000100101111111001… |
… | …100000110101111101101 |
3 | 11001000022111000201100201 |
4 | 100211333030012233231 |
5 | 122140313323310404 |
6 | 2231502514553501 |
7 | 145245462613402 |
oct | 20457714065755 |
9 | 4030274021321 |
10 | 1140300213229 |
11 | 3aa664819741 |
12 | 164bb8298891 |
13 | 836b71016a8 |
14 | 3d2958a22a9 |
15 | 1e9dd9d9ca4 |
hex | 1097f306bed |
1140300213229 has 2 divisors, whose sum is σ = 1140300213230. Its totient is φ = 1140300213228.
The previous prime is 1140300213223. The next prime is 1140300213253. The reversal of 1140300213229 is 9223120030411.
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., 1140201111204 + 99102025 = 1067802^2 + 9955^2 .
It is a cyclic number.
It is not a de Polignac number, because 1140300213229 - 211 = 1140300211181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1140300213197 and 1140300213206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1140300213223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570150106614 + 570150106615.
It is an arithmetic number, because the mean of its divisors is an integer number (570150106615).
Almost surely, 21140300213229 is an apocalyptic number.
It is an amenable number.
1140300213229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140300213229 is an equidigital number, since it uses as much as digits as its factorization.
1140300213229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 1140300213229 in words is "one trillion, one hundred forty billion, three hundred million, two hundred thirteen thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •