Base | Representation |
---|---|
bin | 10001010101011… |
… | …11011101010001 |
3 | 101010122012200222 |
4 | 20222233131101 |
5 | 244212002121 |
6 | 22232522425 |
7 | 3414032213 |
oct | 1052573521 |
9 | 333565628 |
10 | 145422161 |
11 | 750a5905 |
12 | 40850415 |
13 | 24188321 |
14 | 154565b3 |
15 | cb780ab |
hex | 8aaf751 |
145422161 has 4 divisors (see below), whose sum is σ = 145598832. Its totient is φ = 145245492.
The previous prime is 145422149. The next prime is 145422187. The reversal of 145422161 is 161224541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145422161 is a prime.
It is a super-2 number, since 2×1454221612 = 42295209819819842, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145422161.
It is not an unprimeable number, because it can be changed into a prime (145422461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87095 + ... + 88748.
It is an arithmetic number, because the mean of its divisors is an integer number (36399708).
Almost surely, 2145422161 is an apocalyptic number.
It is an amenable number.
145422161 is a deficient number, since it is larger than the sum of its proper divisors (176671).
145422161 is an equidigital number, since it uses as much as digits as its factorization.
145422161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176670.
The product of its digits is 1920, while the sum is 26.
The square root of 145422161 is about 12059.1111198131. Note that the first 5 decimals coincide. The cubic root of 145422161 is about 525.8681460963.
The spelling of 145422161 in words is "one hundred forty-five million, four hundred twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •