Base | Representation |
---|---|
bin | 10001010011001… |
… | …00000001011101 |
3 | 101010001111212021 |
4 | 20221210001131 |
5 | 244122110211 |
6 | 22222140141 |
7 | 3411304333 |
oct | 1051440135 |
9 | 333044767 |
10 | 145113181 |
11 | 74a04754 |
12 | 40721651 |
13 | 240aa7b5 |
14 | 153b5b53 |
15 | cb16771 |
hex | 8a6405d |
145113181 has 2 divisors, whose sum is σ = 145113182. Its totient is φ = 145113180.
The previous prime is 145113179. The next prime is 145113191. The reversal of 145113181 is 181311541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 135932281 + 9180900 = 11659^2 + 3030^2 .
It is an emirp because it is prime and its reverse (181311541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145113181 - 21 = 145113179 is a prime.
It is a super-2 number, since 2×1451131812 = 42115670599877522, which contains 22 as substring.
Together with 145113179, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145113151) 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, 72556590 + 72556591.
It is an arithmetic number, because the mean of its divisors is an integer number (72556591).
Almost surely, 2145113181 is an apocalyptic number.
It is an amenable number.
145113181 is a deficient number, since it is larger than the sum of its proper divisors (1).
145113181 is an equidigital number, since it uses as much as digits as its factorization.
145113181 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 480, while the sum is 25.
The square root of 145113181 is about 12046.2932473023. The cubic root of 145113181 is about 525.4954428097.
The spelling of 145113181 in words is "one hundred forty-five million, one hundred thirteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •