Base | Representation |
---|---|
bin | 11110101011010001100… |
… | …11100110100110100111 |
3 | 10201202121211122022222022 |
4 | 33111220303212212213 |
5 | 114232120442023242 |
6 | 2124113525053355 |
7 | 136102505416544 |
oct | 17255063464647 |
9 | 3652554568868 |
10 | 1054025345447 |
11 | 377011913618 |
12 | 15033ab5725b |
13 | 78517c92479 |
14 | 3902d607bcb |
15 | 1c63e6db0d2 |
hex | f568ce69a7 |
1054025345447 has 2 divisors, whose sum is σ = 1054025345448. Its totient is φ = 1054025345446.
The previous prime is 1054025345411. The next prime is 1054025345449. The reversal of 1054025345447 is 7445435204501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1054025345447 - 212 = 1054025341351 is a prime.
It is a super-2 number, since 2×10540253454472 (a number of 25 digits) contains 22 as substring.
Together with 1054025345449, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1054025345398 and 1054025345407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054025345449) 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, 527012672723 + 527012672724.
It is an arithmetic number, because the mean of its divisors is an integer number (527012672724).
Almost surely, 21054025345447 is an apocalyptic number.
1054025345447 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054025345447 is an equidigital number, since it uses as much as digits as its factorization.
1054025345447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344000, while the sum is 44.
The spelling of 1054025345447 in words is "one trillion, fifty-four billion, twenty-five million, three hundred forty-five thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •