Base | Representation |
---|---|
bin | 10000000011100010001… |
… | …11011111001110110111 |
3 | 1221201220200120120200110 |
4 | 20001301013133032313 |
5 | 33014241310232411 |
6 | 1101232015114103 |
7 | 54566330152014 |
oct | 10016107371667 |
9 | 1851820516613 |
10 | 551653602231 |
11 | 1a2a56093366 |
12 | 8aab7812933 |
13 | 40036670454 |
14 | 1c9b33dc70b |
15 | e53a7642a6 |
hex | 80711df3b7 |
551653602231 has 8 divisors (see below), whose sum is σ = 735915149824. Its totient is φ = 367580561400.
The previous prime is 551653602191. The next prime is 551653602233. The reversal of 551653602231 is 132206356155.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 551653602231 - 210 = 551653601207 is a prime.
It is a super-2 number, since 2×5516536022312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 551653602231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551653602233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47119861 + ... + 47131566.
It is an arithmetic number, because the mean of its divisors is an integer number (91989393728).
Almost surely, 2551653602231 is an apocalyptic number.
551653602231 is a deficient number, since it is larger than the sum of its proper divisors (184261547593).
551653602231 is a wasteful number, since it uses less digits than its factorization.
551653602231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94253381.
The product of its (nonzero) digits is 162000, while the sum is 39.
Adding to 551653602231 its reverse (132206356155), we get a palindrome (683859958386).
The spelling of 551653602231 in words is "five hundred fifty-one billion, six hundred fifty-three million, six hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •