Base | Representation |
---|---|
bin | 10000110101110… |
… | …10000000011001 |
3 | 100211211022110200 |
4 | 20122322000121 |
5 | 242131133230 |
6 | 22003532413 |
7 | 3333532665 |
oct | 1032720031 |
9 | 324738420 |
10 | 141271065 |
11 | 72820051 |
12 | 3b38a109 |
13 | 23363a60 |
14 | 14a958a5 |
15 | c608160 |
hex | 86ba019 |
141271065 has 24 divisors (see below), whose sum is σ = 263707080. Its totient is φ = 69548544.
The previous prime is 141271057. The next prime is 141271073. The reversal of 141271065 is 560172141.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (141271057) and next prime (141271073).
It can be written as a sum of positive squares in 4 ways, for example, as 207936 + 141063129 = 456^2 + 11877^2 .
It is not a de Polignac number, because 141271065 - 23 = 141271057 is a prime.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 120160 + ... + 121329.
It is an arithmetic number, because the mean of its divisors is an integer number (10987795).
Almost surely, 2141271065 is an apocalyptic number.
141271065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
141271065 is a deficient number, since it is larger than the sum of its proper divisors (122436015).
141271065 is a wasteful number, since it uses less digits than its factorization.
141271065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241513 (or 241510 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 141271065 is about 11885.7505021770. The cubic root of 141271065 is about 520.8161063244.
The spelling of 141271065 in words is "one hundred forty-one million, two hundred seventy-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •