Base | Representation |
---|---|
bin | 10001010110001… |
… | …01101101110011 |
3 | 101010210211202122 |
4 | 20223011231303 |
5 | 244222411311 |
6 | 22234504455 |
7 | 3414562055 |
oct | 1053055563 |
9 | 333724678 |
10 | 145513331 |
11 | 75158357 |
12 | 4089512b |
13 | 241ba982 |
14 | 1547b8d5 |
15 | cb950db |
hex | 8ac5b73 |
145513331 has 2 divisors, whose sum is σ = 145513332. Its totient is φ = 145513330.
The previous prime is 145513301. The next prime is 145513351. The reversal of 145513331 is 133315541.
It is a strong prime.
It is an emirp because it is prime and its reverse (133315541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145513331 is a prime.
It is a super-2 number, since 2×1455133312 = 42348258997431122, which contains 22 as substring.
It is equal to p8205830 and since 145513331 and 8205830 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145513331.
It is not a weakly prime, because it can be changed into another prime (145513301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72756665 + 72756666.
It is an arithmetic number, because the mean of its divisors is an integer number (72756666).
Almost surely, 2145513331 is an apocalyptic number.
145513331 is a deficient number, since it is larger than the sum of its proper divisors (1).
145513331 is an equidigital number, since it uses as much as digits as its factorization.
145513331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2700, while the sum is 26.
The square root of 145513331 is about 12062.8906568865. The cubic root of 145513331 is about 525.9780178952.
Adding to 145513331 its reverse (133315541), we get a palindrome (278828872).
The spelling of 145513331 in words is "one hundred forty-five million, five hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •