Base | Representation |
---|---|
bin | 11110101100001010001… |
… | …11011101110101001111 |
3 | 10201210211221101020221202 |
4 | 33112011013131311033 |
5 | 114234104040030242 |
6 | 2124233013220115 |
7 | 136120333532036 |
oct | 17260507356517 |
9 | 3653757336852 |
10 | 1054500314447 |
11 | 377235a33888 |
12 | 15045203163b |
13 | 785924c2208 |
14 | 3907672571d |
15 | 1c66b25c932 |
hex | f5851ddd4f |
1054500314447 has 2 divisors, whose sum is σ = 1054500314448. Its totient is φ = 1054500314446.
The previous prime is 1054500314353. The next prime is 1054500314449. The reversal of 1054500314447 is 7444130054501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1054500314447 is a prime.
It is a super-2 number, since 2×10545003144472 (a number of 25 digits) contains 22 as substring.
Together with 1054500314449, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1054500314447.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054500314449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527250157223 + 527250157224.
It is an arithmetic number, because the mean of its divisors is an integer number (527250157224).
Almost surely, 21054500314447 is an apocalyptic number.
1054500314447 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054500314447 is an equidigital number, since it uses as much as digits as its factorization.
1054500314447 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 134400, while the sum is 38.
Adding to 1054500314447 its reverse (7444130054501), we get a palindrome (8498630368948).
The spelling of 1054500314447 in words is "one trillion, fifty-four billion, five hundred million, three hundred fourteen thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •