Base | Representation |
---|---|
bin | 10000000000110110110… |
… | …01001011111010101011 |
3 | 1221121012110100101200001 |
4 | 20000123121023322223 |
5 | 33003320120314011 |
6 | 1100433201323431 |
7 | 54515564512624 |
oct | 10003331137253 |
9 | 1847173311601 |
10 | 550215401131 |
11 | 1a2388282610 |
12 | 8a776036577 |
13 | 3cb67707b96 |
14 | 1c8b83c4a4b |
15 | e4a43757c1 |
hex | 801b64beab |
550215401131 has 16 divisors (see below), whose sum is σ = 607001205888. Its totient is φ = 494567136000.
The previous prime is 550215401123. The next prime is 550215401147. The reversal of 550215401131 is 131104512055.
It is a cyclic number.
It is not a de Polignac number, because 550215401131 - 23 = 550215401123 is a prime.
It is a super-2 number, since 2×5502154011312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 550215401131.
It is not an unprimeable number, because it can be changed into a prime (550215401231) 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 15 ways as a sum of consecutive naturals, for example, 876096 + ... + 1366738.
It is an arithmetic number, because the mean of its divisors is an integer number (37937575368).
Almost surely, 2550215401131 is an apocalyptic number.
550215401131 is a deficient number, since it is larger than the sum of its proper divisors (56785804757).
550215401131 is a wasteful number, since it uses less digits than its factorization.
550215401131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491802.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 550215401131 its reverse (131104512055), we get a palindrome (681319913186).
The spelling of 550215401131 in words is "five hundred fifty billion, two hundred fifteen million, four hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •