Base | Representation |
---|---|
bin | 10000111011000… |
… | …11111101111001 |
3 | 100220010200102101 |
4 | 20131203331321 |
5 | 242320422400 |
6 | 22030503401 |
7 | 3342462421 |
oct | 1035437571 |
9 | 326120371 |
10 | 141967225 |
11 | 73156094 |
12 | 3b664b61 |
13 | 2354889a |
14 | 14bd7481 |
15 | c6e456a |
hex | 8763f79 |
141967225 has 9 divisors (see below), whose sum is σ = 176113263. Its totient is φ = 113526120.
The previous prime is 141967141. The next prime is 141967229. The reversal of 141967225 is 522769141.
The square root of 141967225 is 11915.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 51108201 + 90859024 = 7149^2 + 9532^2 .
It is not a de Polignac number, because 141967225 - 223 = 133578617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141967229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 58384 + ... + 60766.
Almost surely, 2141967225 is an apocalyptic number.
141967225 is the 11915-th square number.
141967225 is the 5958-th centered octagonal number.
It is an amenable number.
141967225 is a deficient number, since it is larger than the sum of its proper divisors (34146038).
141967225 is an frugal number, since it uses more digits than its factorization.
141967225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4776 (or 2388 counting only the distinct ones).
The product of its digits is 30240, while the sum is 37.
The cubic root of 141967225 is about 521.6702029087.
It can be divided in two parts, 1419 and 67225, that added together give a square (68644 = 2622).
The spelling of 141967225 in words is "one hundred forty-one million, nine hundred sixty-seven thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •