Base | Representation |
---|---|
bin | 10010100000011… |
… | …00100111110101 |
3 | 101211010001112210 |
4 | 21100030213311 |
5 | 304220202244 |
6 | 23223204033 |
7 | 3563345343 |
oct | 1120144765 |
9 | 354101483 |
10 | 155240949 |
11 | 7a6a1906 |
12 | 43ba6619 |
13 | 26215566 |
14 | 16890993 |
15 | d9674b9 |
hex | 940c9f5 |
155240949 has 4 divisors (see below), whose sum is σ = 206987936. Its totient is φ = 103493964.
The previous prime is 155240947. The next prime is 155240951. The reversal of 155240949 is 949042551.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (155240947) and next prime (155240951).
It is not a de Polignac number, because 155240949 - 21 = 155240947 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155240941) 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 3 ways as a sum of consecutive naturals, for example, 25873489 + ... + 25873494.
It is an arithmetic number, because the mean of its divisors is an integer number (51746984).
Almost surely, 2155240949 is an apocalyptic number.
It is an amenable number.
155240949 is a deficient number, since it is larger than the sum of its proper divisors (51746987).
155240949 is an equidigital number, since it uses as much as digits as its factorization.
155240949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51746986.
The product of its (nonzero) digits is 64800, while the sum is 39.
The square root of 155240949 is about 12459.5725849645. The cubic root of 155240949 is about 537.4467359514.
The spelling of 155240949 in words is "one hundred fifty-five million, two hundred forty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •