Base | Representation |
---|---|
bin | 10000000001000011100… |
… | …00111111000010011011 |
3 | 1221121110220111120122101 |
4 | 20000201300333002123 |
5 | 33004030002200011 |
6 | 1100451540504231 |
7 | 54521333252356 |
oct | 10004160770233 |
9 | 1847426446571 |
10 | 550322303131 |
11 | 1a2432658677 |
12 | 8a7a59ab077 |
13 | 3cb838c70c3 |
14 | 1c8c869129d |
15 | e4ad9402c1 |
hex | 8021c3f09b |
550322303131 has 4 divisors (see below), whose sum is σ = 562031288352. Its totient is φ = 538613317912.
The previous prime is 550322303123. The next prime is 550322303149. The reversal of 550322303131 is 131303223055.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 550322303131 - 23 = 550322303123 is a prime.
It is a super-2 number, since 2×5503223031312 (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 550322303131.
It is not an unprimeable number, because it can be changed into a prime (550322303431) 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, 5854492540 + ... + 5854492633.
It is an arithmetic number, because the mean of its divisors is an integer number (140507822088).
Almost surely, 2550322303131 is an apocalyptic number.
550322303131 is a deficient number, since it is larger than the sum of its proper divisors (11708985221).
550322303131 is a wasteful number, since it uses less digits than its factorization.
550322303131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11708985220.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 550322303131 its reverse (131303223055), we get a palindrome (681625526186).
The spelling of 550322303131 in words is "five hundred fifty billion, three hundred twenty-two million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •