Base | Representation |
---|---|
bin | 10000000011100001110… |
… | …10010100011011111101 |
3 | 1221201220110002012022021 |
4 | 20001300322110123331 |
5 | 33014234414301031 |
6 | 1101231413120141 |
7 | 54566255623426 |
oct | 10016072243375 |
9 | 1851813065267 |
10 | 551650150141 |
11 | 1a2a541457a2 |
12 | 8aab6629051 |
13 | 40035a320ac |
14 | 1c9b2b8064d |
15 | e53a2d1511 |
hex | 8070e946fd |
551650150141 has 4 divisors (see below), whose sum is σ = 551721256000. Its totient is φ = 551579044284.
The previous prime is 551650150097. The next prime is 551650150157. The reversal of 551650150141 is 141051056155.
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 551650150141 - 213 = 551650141949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 551650150097 and 551650150106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551650150741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35541291 + ... + 35556808.
It is an arithmetic number, because the mean of its divisors is an integer number (137930314000).
Almost surely, 2551650150141 is an apocalyptic number.
It is an amenable number.
551650150141 is a deficient number, since it is larger than the sum of its proper divisors (71105859).
551650150141 is an equidigital number, since it uses as much as digits as its factorization.
551650150141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71105858.
The product of its (nonzero) digits is 15000, while the sum is 34.
The spelling of 551650150141 in words is "five hundred fifty-one billion, six hundred fifty million, one hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •