Base | Representation |
---|---|
bin | 11110100011110010010… |
… | …11011010100010011111 |
3 | 10201101020122202110011002 |
4 | 33101321023122202133 |
5 | 114200402243240042 |
6 | 2122210552220515 |
7 | 135601050466202 |
oct | 17217113324237 |
9 | 3641218673132 |
10 | 1050005055647 |
11 | 375339531369 |
12 | 14b5b869a73b |
13 | 780270b8772 |
14 | 38b6b6d1939 |
15 | 1c4a67a9132 |
hex | f4792da89f |
1050005055647 has 2 divisors, whose sum is σ = 1050005055648. Its totient is φ = 1050005055646.
The previous prime is 1050005055581. The next prime is 1050005055661. The reversal of 1050005055647 is 7465505000501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1050005055647 - 224 = 1049988278431 is a prime.
It is a super-2 number, since 2×10500050556472 (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 1050005055647.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050005025647) 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, 525002527823 + 525002527824.
It is an arithmetic number, because the mean of its divisors is an integer number (525002527824).
Almost surely, 21050005055647 is an apocalyptic number.
1050005055647 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050005055647 is an equidigital number, since it uses as much as digits as its factorization.
1050005055647 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105000, while the sum is 38.
The spelling of 1050005055647 in words is "one trillion, fifty billion, five million, fifty-five thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •