Base | Representation |
---|---|
bin | 11101100001010100010… |
… | …01100110111110011101 |
3 | 10120222010122222112122222 |
4 | 32300222021212332131 |
5 | 113104311234200434 |
6 | 2053545533515125 |
7 | 133165532005544 |
oct | 16605211467635 |
9 | 3528118875588 |
10 | 1014319443869 |
11 | 361196979026 |
12 | 1446b9642aa5 |
13 | 7485ab22754 |
14 | 3714411515b |
15 | 1b5b894972e |
hex | ec2a266f9d |
1014319443869 has 2 divisors, whose sum is σ = 1014319443870. Its totient is φ = 1014319443868.
The previous prime is 1014319443847. The next prime is 1014319443971. The reversal of 1014319443869 is 9683449134101.
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., 984931198969 + 29388244900 = 992437^2 + 171430^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1014319443869 is a prime.
It is a super-2 number, since 2×10143194438692 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1014319443869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1014319443769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507159721934 + 507159721935.
It is an arithmetic number, because the mean of its divisors is an integer number (507159721935).
Almost surely, 21014319443869 is an apocalyptic number.
It is an amenable number.
1014319443869 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014319443869 is an equidigital number, since it uses as much as digits as its factorization.
1014319443869 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2239488, while the sum is 53.
The spelling of 1014319443869 in words is "one trillion, fourteen billion, three hundred nineteen million, four hundred forty-three thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •