Base | Representation |
---|---|
bin | 10010100000001… |
… | …01001010111111 |
3 | 101211001111200111 |
4 | 21100011022333 |
5 | 304213213211 |
6 | 23222410451 |
7 | 3563160355 |
oct | 1120051277 |
9 | 354044614 |
10 | 155210431 |
11 | 7a680992 |
12 | 43b90a27 |
13 | 262046bc |
14 | 168837d5 |
15 | d95d421 |
hex | 94052bf |
155210431 has 8 divisors (see below), whose sum is σ = 157489920. Its totient is φ = 152938968.
The previous prime is 155210423. The next prime is 155210477. The reversal of 155210431 is 134012551.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 155210431 - 23 = 155210423 is a prime.
It is a super-2 number, since 2×1552104312 = 48180555782411522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155210131) 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 7 ways as a sum of consecutive naturals, for example, 44700 + ... + 48046.
It is an arithmetic number, because the mean of its divisors is an integer number (19686240).
Almost surely, 2155210431 is an apocalyptic number.
155210431 is a deficient number, since it is larger than the sum of its proper divisors (2279489).
155210431 is an equidigital number, since it uses as much as digits as its factorization.
155210431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4013.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 155210431 is about 12458.3478439157. The cubic root of 155210431 is about 537.4115157030.
Adding to 155210431 its reverse (134012551), we get a palindrome (289222982).
The spelling of 155210431 in words is "one hundred fifty-five million, two hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •