Base | Representation |
---|---|
bin | 111110110000101000111110… |
… | …1101101101110110011111001 |
3 | 2200101121210002002012021010010 |
4 | 1331201101331231232303321 |
5 | 1034324132221440122224 |
6 | 5234032552054412133 |
7 | 224164531225056261 |
oct | 17541217555566371 |
9 | 2611553062167103 |
10 | 552042845629689 |
11 | 14a9970686a3457 |
12 | 51ab9728061049 |
13 | 1a90555611591b |
14 | 9a470329c27a1 |
15 | 43c4d7bc71e29 |
hex | 1f6147db6ecf9 |
552042845629689 has 32 divisors (see below), whose sum is σ = 739236419282304. Its totient is φ = 366440869670400.
The previous prime is 552042845629673. The next prime is 552042845629753. The reversal of 552042845629689 is 986926548240255.
It is not a de Polignac number, because 552042845629689 - 24 = 552042845629673 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 552042845629689.
It is not an unprimeable number, because it can be changed into a prime (552042845629669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9318250102 + ... + 9318309344.
It is an arithmetic number, because the mean of its divisors is an integer number (23101138102572).
Almost surely, 2552042845629689 is an apocalyptic number.
It is an amenable number.
552042845629689 is a deficient number, since it is larger than the sum of its proper divisors (187193573652615).
552042845629689 is a wasteful number, since it uses less digits than its factorization.
552042845629689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67257.
The product of its (nonzero) digits is 2985984000, while the sum is 75.
The spelling of 552042845629689 in words is "five hundred fifty-two trillion, forty-two billion, eight hundred forty-five million, six hundred twenty-nine thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •