Base | Representation |
---|---|
bin | 10000110100111… |
… | …00010001001001 |
3 | 100211121010101021 |
4 | 20122130101021 |
5 | 242113234012 |
6 | 22001152441 |
7 | 3332514604 |
oct | 1032342111 |
9 | 324533337 |
10 | 141149257 |
11 | 72747587 |
12 | 3b32b721 |
13 | 23320492 |
14 | 14a6333b |
15 | c5d2007 |
hex | 869c449 |
141149257 has 2 divisors, whose sum is σ = 141149258. Its totient is φ = 141149256.
The previous prime is 141149227. The next prime is 141149269. The reversal of 141149257 is 752941141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99920016 + 41229241 = 9996^2 + 6421^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141149257 is a prime.
It is a super-2 number, since 2×1411492572 = 39846225503304098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (141149227) 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, 70574628 + 70574629.
It is an arithmetic number, because the mean of its divisors is an integer number (70574629).
Almost surely, 2141149257 is an apocalyptic number.
It is an amenable number.
141149257 is a deficient number, since it is larger than the sum of its proper divisors (1).
141149257 is an equidigital number, since it uses as much as digits as its factorization.
141149257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10080, while the sum is 34.
The square root of 141149257 is about 11880.6252781577. The cubic root of 141149257 is about 520.6663757098. Note that the first 3 decimals are identical.
The spelling of 141149257 in words is "one hundred forty-one million, one hundred forty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •