Base | Representation |
---|---|
bin | 10010100001111… |
… | …01010011000011 |
3 | 101211111012001000 |
4 | 21100331103003 |
5 | 304243042243 |
6 | 23231343043 |
7 | 3565135533 |
oct | 1120752303 |
9 | 354435030 |
10 | 155440323 |
11 | 7a818685 |
12 | 44081a83 |
13 | 2628522c |
14 | 169034c3 |
15 | d9a65d3 |
hex | 943d4c3 |
155440323 has 8 divisors (see below), whose sum is σ = 230282000. Its totient is φ = 103626864.
The previous prime is 155440303. The next prime is 155440331. The reversal of 155440323 is 323044551.
It is not a de Polignac number, because 155440323 - 213 = 155432131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 5757049 = 155440323 / (1 + 5 + 5 + 4 + 4 + 0 + 3 + 2 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155440303) 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, 2878498 + ... + 2878551.
It is an arithmetic number, because the mean of its divisors is an integer number (28785250).
Almost surely, 2155440323 is an apocalyptic number.
155440323 is a deficient number, since it is larger than the sum of its proper divisors (74841677).
155440323 is an equidigital number, since it uses as much as digits as its factorization.
155440323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5757058 (or 5757052 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 155440323 is about 12467.5708540196. The cubic root of 155440323 is about 537.6767162223.
Adding to 155440323 its reverse (323044551), we get a palindrome (478484874).
The spelling of 155440323 in words is "one hundred fifty-five million, four hundred forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •