Base | Representation |
---|---|
bin | 101110001101010… |
… | …1110110000011011 |
3 | 11000001120010102012 |
4 | 1130122232300123 |
5 | 11133412324011 |
6 | 413504500135 |
7 | 53265061421 |
oct | 13432566033 |
9 | 4001503365 |
10 | 1550511131 |
11 | 72624aa64 |
12 | 37331a64b |
13 | 1b92c9210 |
14 | 109cd1111 |
15 | 911c5a8b |
hex | 5c6aec1b |
1550511131 has 32 divisors (see below), whose sum is σ = 1813674240. Its totient is φ = 1313380224.
The previous prime is 1550511113. The next prime is 1550511133. The reversal of 1550511131 is 1311150551.
It is a de Polignac number, because none of the positive numbers 2k-1550511131 is a prime.
It is a super-2 number, since 2×15505111312 = 4808169534709798322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1550511097 and 1550511106.
It is not an unprimeable number, because it can be changed into a prime (1550511133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1085840 + ... + 1087266.
It is an arithmetic number, because the mean of its divisors is an integer number (56677320).
Almost surely, 21550511131 is an apocalyptic number.
1550511131 is a deficient number, since it is larger than the sum of its proper divisors (263163109).
1550511131 is a wasteful number, since it uses less digits than its factorization.
1550511131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1595.
The product of its (nonzero) digits is 375, while the sum is 23.
The square root of 1550511131 is about 39376.5302051869. The cubic root of 1550511131 is about 1157.4217238435.
Adding to 1550511131 its reverse (1311150551), we get a palindrome (2861661682).
The spelling of 1550511131 in words is "one billion, five hundred fifty million, five hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.384 sec. • engine limits •