Base | Representation |
---|---|
bin | 10110100011110010011… |
… | …011100011100000000011 |
3 | 12111012110222021220000120 |
4 | 112203302123203200003 |
5 | 200344410404124011 |
6 | 3144102204151323 |
7 | 220000530431421 |
oct | 26436233434003 |
9 | 5435428256016 |
10 | 1550255536131 |
11 | 548506920525 |
12 | 210549538543 |
13 | b325b0b6833 |
14 | 55065cb8111 |
15 | 2a4d43b8a06 |
hex | 168f26e3803 |
1550255536131 has 8 divisors (see below), whose sum is σ = 2133685039104. Its totient is φ = 1000164861960.
The previous prime is 1550255536129. The next prime is 1550255536153. The reversal of 1550255536131 is 1316355520551.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1550255536131 - 21 = 1550255536129 is a prime.
It is a super-2 number, since 2×15502555361312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1550255536931) 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 7 ways as a sum of consecutive naturals, for example, 8334707091 + ... + 8334707276.
It is an arithmetic number, because the mean of its divisors is an integer number (266710629888).
Almost surely, 21550255536131 is an apocalyptic number.
1550255536131 is a deficient number, since it is larger than the sum of its proper divisors (583429502973).
1550255536131 is a wasteful number, since it uses less digits than its factorization.
1550255536131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16669414401.
The product of its (nonzero) digits is 337500, while the sum is 42.
The spelling of 1550255536131 in words is "one trillion, five hundred fifty billion, two hundred fifty-five million, five hundred thirty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •