Base | Representation |
---|---|
bin | 1001000100100101010… |
… | …0100111000001010011 |
3 | 112220021101022120112122 |
4 | 2101021110213001103 |
5 | 10023134313242011 |
6 | 155332424044455 |
7 | 14155040214662 |
oct | 2211124470123 |
9 | 486241276478 |
10 | 155848962131 |
11 | 60105748a55 |
12 | 2625560372b |
13 | 11909274ab5 |
14 | 77864c4dd9 |
15 | 40c23303db |
hex | 2449527053 |
155848962131 has 4 divisors (see below), whose sum is σ = 157392021264. Its totient is φ = 154305903000.
The previous prime is 155848962103. The next prime is 155848962163. The reversal of 155848962131 is 131269848551.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131269848551 = 1549 ⋅84744899.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-155848962131 is a prime.
It is a super-2 number, since 2×1558489621312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155848962431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 771529415 + ... + 771529616.
It is an arithmetic number, because the mean of its divisors is an integer number (39348005316).
Almost surely, 2155848962131 is an apocalyptic number.
155848962131 is a deficient number, since it is larger than the sum of its proper divisors (1543059133).
155848962131 is a wasteful number, since it uses less digits than its factorization.
155848962131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1543059132.
The product of its digits is 2073600, while the sum is 53.
The spelling of 155848962131 in words is "one hundred fifty-five billion, eight hundred forty-eight million, nine hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •