Base | Representation |
---|---|
bin | 10000000001001000000… |
… | …10101111001000110111 |
3 | 1221121120120101202000210 |
4 | 20000210002233020313 |
5 | 33004114242323111 |
6 | 1100455423440503 |
7 | 54522306104562 |
oct | 10004402571067 |
9 | 1847516352023 |
10 | 550360511031 |
11 | 1a2452184851 |
12 | 8a7b6756133 |
13 | 3cb8b7b4026 |
14 | 1c8cd7994d9 |
15 | e4b1e8b0a6 |
hex | 80240af237 |
550360511031 has 4 divisors (see below), whose sum is σ = 733814014712. Its totient is φ = 366907007352.
The previous prime is 550360511023. The next prime is 550360511069. The reversal of 550360511031 is 130115063055.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 550360511031 - 23 = 550360511023 is a prime.
It is a super-2 number, since 2×5503605110312 (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 550360511031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550360511021) 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, 91726751836 + ... + 91726751841.
It is an arithmetic number, because the mean of its divisors is an integer number (183453503678).
Almost surely, 2550360511031 is an apocalyptic number.
550360511031 is a deficient number, since it is larger than the sum of its proper divisors (183453503681).
550360511031 is a wasteful number, since it uses less digits than its factorization.
550360511031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183453503680.
The product of its (nonzero) digits is 6750, while the sum is 30.
Adding to 550360511031 its reverse (130115063055), we get a palindrome (680475574086).
The spelling of 550360511031 in words is "five hundred fifty billion, three hundred sixty million, five hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •