Base | Representation |
---|---|
bin | 10001010100101… |
… | …01000100001101 |
3 | 101010102201102021 |
4 | 20222111010031 |
5 | 244200022221 |
6 | 22230330141 |
7 | 3413102104 |
oct | 1052250415 |
9 | 333381367 |
10 | 145314061 |
11 | 75031672 |
12 | 407b9951 |
13 | 2414b069 |
14 | 1542903b |
15 | cb56041 |
hex | 8a9510d |
145314061 has 2 divisors, whose sum is σ = 145314062. Its totient is φ = 145314060.
The previous prime is 145314047. The next prime is 145314073. The reversal of 145314061 is 160413541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125865961 + 19448100 = 11219^2 + 4410^2 .
It is an emirp because it is prime and its reverse (160413541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145314061 - 27 = 145313933 is a prime.
It is a super-3 number, since 3×1453140613 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145314031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72657030 + 72657031.
It is an arithmetic number, because the mean of its divisors is an integer number (72657031).
Almost surely, 2145314061 is an apocalyptic number.
It is an amenable number.
145314061 is a deficient number, since it is larger than the sum of its proper divisors (1).
145314061 is an equidigital number, since it uses as much as digits as its factorization.
145314061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 145314061 is about 12054.6281983311. The cubic root of 145314061 is about 525.7378119078.
The spelling of 145314061 in words is "one hundred forty-five million, three hundred fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •