Base | Representation |
---|---|
bin | 101010111011001… |
… | …1001111000011111 |
3 | 10201101020002122222 |
4 | 1111312121320133 |
5 | 10422210401101 |
6 | 354531055555 |
7 | 50456363456 |
oct | 12566317037 |
9 | 3641202588 |
10 | 1440325151 |
11 | 67a031671 |
12 | 3424415bb |
13 | 19c52a305 |
14 | d940bb9d |
15 | 866ad01b |
hex | 55d99e1f |
1440325151 has 2 divisors, whose sum is σ = 1440325152. Its totient is φ = 1440325150.
The previous prime is 1440325147. The next prime is 1440325177. The reversal of 1440325151 is 1515230441.
It is an a-pointer prime, because the next prime (1440325177) can be obtained adding 1440325151 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1440325151 - 22 = 1440325147 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1440325151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1440325141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 720162575 + 720162576.
It is an arithmetic number, because the mean of its divisors is an integer number (720162576).
Almost surely, 21440325151 is an apocalyptic number.
1440325151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1440325151 is an equidigital number, since it uses as much as digits as its factorization.
1440325151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 1440325151 is about 37951.6159208011. The cubic root of 1440325151 is about 1129.3282223736.
Adding to 1440325151 its reverse (1515230441), we get a palindrome (2955555592).
The spelling of 1440325151 in words is "one billion, four hundred forty million, three hundred twenty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •