Base | Representation |
---|---|
bin | 10000000100010111110… |
… | …11001011111001011101 |
3 | 1221210002000212202021220 |
4 | 20002023323023321131 |
5 | 33021201430042031 |
6 | 1101344403043553 |
7 | 54613431101262 |
oct | 10021373137135 |
9 | 1853060782256 |
10 | 552103362141 |
11 | 1a3166a55671 |
12 | 8b0023705b9 |
13 | 400a88b4a86 |
14 | 1ca17037269 |
15 | e564ea6596 |
hex | 808becbe5d |
552103362141 has 4 divisors (see below), whose sum is σ = 736137816192. Its totient is φ = 368068908092.
The previous prime is 552103362121. The next prime is 552103362143. The reversal of 552103362141 is 141263301255.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 552103362141 - 235 = 517743623773 is a prime.
It is a super-3 number, since 3×5521033621413 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552103362143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92017227021 + ... + 92017227026.
It is an arithmetic number, because the mean of its divisors is an integer number (184034454048).
Almost surely, 2552103362141 is an apocalyptic number.
It is an amenable number.
552103362141 is a deficient number, since it is larger than the sum of its proper divisors (184034454051).
552103362141 is a wasteful number, since it uses less digits than its factorization.
552103362141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184034454050.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 552103362141 its reverse (141263301255), we get a palindrome (693366663396).
The spelling of 552103362141 in words is "five hundred fifty-two billion, one hundred three million, three hundred sixty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •