Base | Representation |
---|---|
bin | 11101100001101101011… |
… | …10111011101001001001 |
3 | 10120222200101020001221001 |
4 | 32300312232323221021 |
5 | 113110224310220231 |
6 | 2054022514415001 |
7 | 133204004266345 |
oct | 16606656735111 |
9 | 3528611201831 |
10 | 1014530554441 |
11 | 36129505a578 |
12 | 144758291461 |
13 | 74892799c51 |
14 | 3716418a625 |
15 | 1b5cc24ab61 |
hex | ec36bbba49 |
1014530554441 has 2 divisors, whose sum is σ = 1014530554442. Its totient is φ = 1014530554440.
The previous prime is 1014530554439. The next prime is 1014530554451. The reversal of 1014530554441 is 1444550354101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 878336342416 + 136194212025 = 937196^2 + 369045^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014530554441 - 21 = 1014530554439 is a prime.
Together with 1014530554439, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1014530554441.
It is not a weakly prime, because it can be changed into another prime (1014530554451) 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, 507265277220 + 507265277221.
It is an arithmetic number, because the mean of its divisors is an integer number (507265277221).
Almost surely, 21014530554441 is an apocalyptic number.
It is an amenable number.
1014530554441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014530554441 is an equidigital number, since it uses as much as digits as its factorization.
1014530554441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96000, while the sum is 37.
The spelling of 1014530554441 in words is "one trillion, fourteen billion, five hundred thirty million, five hundred fifty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •