Base | Representation |
---|---|
bin | 10000000000111010010… |
… | …00000000110010011011 |
3 | 1221121021111000102001212 |
4 | 20000131020000302123 |
5 | 33003400040003111 |
6 | 1100440120133335 |
7 | 54516366453533 |
oct | 10003510006233 |
9 | 1847244012055 |
10 | 550244453531 |
11 | 1a23a2716063 |
12 | 8a78390724b |
13 | 3cb7073a756 |
14 | 1c8bc1c84c3 |
15 | e4a6bb398b |
hex | 801d200c9b |
550244453531 has 4 divisors (see below), whose sum is σ = 550383865752. Its totient is φ = 550105041312.
The previous prime is 550244453527. The next prime is 550244453537. The reversal of 550244453531 is 135354442055.
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 550244453531 - 22 = 550244453527 is a prime.
It is a super-2 number, since 2×5502444535312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550244453537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69700190 + ... + 69708083.
It is an arithmetic number, because the mean of its divisors is an integer number (137595966438).
Almost surely, 2550244453531 is an apocalyptic number.
550244453531 is a deficient number, since it is larger than the sum of its proper divisors (139412221).
550244453531 is a wasteful number, since it uses less digits than its factorization.
550244453531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139412220.
The product of its (nonzero) digits is 720000, while the sum is 41.
Adding to 550244453531 its reverse (135354442055), we get a palindrome (685598895586).
The spelling of 550244453531 in words is "five hundred fifty billion, two hundred forty-four million, four hundred fifty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •