Base | Representation |
---|---|
bin | 1001000011000100000… |
… | …0011100110010000011 |
3 | 112212012221201011210211 |
4 | 2100301000130302003 |
5 | 10021320400233011 |
6 | 155224132334551 |
7 | 14141654622241 |
oct | 2206100346203 |
9 | 485187634724 |
10 | 155441024131 |
11 | 5aa16451108 |
12 | 26160a74457 |
13 | 118728b4373 |
14 | 7748255791 |
15 | 409b5eeb21 |
hex | 243101cc83 |
155441024131 has 16 divisors (see below), whose sum is σ = 166183815168. Its totient is φ = 145031515200.
The previous prime is 155441024117. The next prime is 155441024159. The reversal of 155441024131 is 131420144551.
It is a cyclic number.
It is not a de Polignac number, because 155441024131 - 217 = 155440893059 is a prime.
It is a super-2 number, since 2×1554410241312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 155441024093 and 155441024102.
It is not an unprimeable number, because it can be changed into a prime (155441024191) 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 15 ways as a sum of consecutive naturals, for example, 7804696 + ... + 7824586.
It is an arithmetic number, because the mean of its divisors is an integer number (10386488448).
Almost surely, 2155441024131 is an apocalyptic number.
155441024131 is a deficient number, since it is larger than the sum of its proper divisors (10742791037).
155441024131 is a wasteful number, since it uses less digits than its factorization.
155441024131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28242.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 155441024131 its reverse (131420144551), we get a palindrome (286861168682).
The spelling of 155441024131 in words is "one hundred fifty-five billion, four hundred forty-one million, twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •