Base | Representation |
---|---|
bin | 10000111001000… |
… | …00100110001011 |
3 | 100212121122220000 |
4 | 20130200212023 |
5 | 242233110100 |
6 | 22020534043 |
7 | 3340233045 |
oct | 1034404613 |
9 | 325548800 |
10 | 141691275 |
11 | 72a87830 |
12 | 3b551323 |
13 | 234800bb |
14 | 14b64a95 |
15 | c68c900 |
hex | 872098b |
141691275 has 60 divisors (see below), whose sum is σ = 286366344. Its totient is φ = 68688000.
The previous prime is 141691271. The next prime is 141691279. The reversal of 141691275 is 572196141.
It is an interprime number because it is at equal distance from previous prime (141691271) and next prime (141691279).
It is not a de Polignac number, because 141691275 - 22 = 141691271 is a prime.
It is a super-2 number, since 2×1416912752 = 40152834822251250, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (141691271) 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 in 59 ways as a sum of consecutive naturals, for example, 19095 + ... + 25455.
Almost surely, 2141691275 is an apocalyptic number.
141691275 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
141691275 is an abundant number, since it is smaller than the sum of its proper divisors (144675069).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141691275 is a wasteful number, since it uses less digits than its factorization.
141691275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6394 (or 6380 counting only the distinct ones).
The product of its digits is 15120, while the sum is 36.
The square root of 141691275 is about 11903.4144261216. The cubic root of 141691275 is about 521.3319833783.
The spelling of 141691275 in words is "one hundred forty-one million, six hundred ninety-one thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •