Base | Representation |
---|---|
bin | 10000110011111… |
… | …01111101001101 |
3 | 100211100211001220 |
4 | 20121331331031 |
5 | 242100300401 |
6 | 21554353553 |
7 | 3331456620 |
oct | 1031757515 |
9 | 324324056 |
10 | 141025101 |
11 | 72672278 |
12 | 3b28b8b9 |
13 | 232a8b09 |
14 | 14a2ddb7 |
15 | c5aa336 |
hex | 867df4d |
141025101 has 8 divisors (see below), whose sum is σ = 214895424. Its totient is φ = 80585760.
The previous prime is 141025097. The next prime is 141025111. The reversal of 141025101 is 101520141.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141025101 - 22 = 141025097 is a prime.
It is a super-2 number, since 2×1410251012 = 39776158224120402, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141025111) 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 7 ways as a sum of consecutive naturals, for example, 3357720 + ... + 3357761.
It is an arithmetic number, because the mean of its divisors is an integer number (26861928).
Almost surely, 2141025101 is an apocalyptic number.
It is an amenable number.
141025101 is a deficient number, since it is larger than the sum of its proper divisors (73870323).
141025101 is an equidigital number, since it uses as much as digits as its factorization.
141025101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6715491.
The product of its (nonzero) digits is 40, while the sum is 15.
The square root of 141025101 is about 11875.3989827711. The cubic root of 141025101 is about 520.5136701769.
Adding to 141025101 its reverse (101520141), we get a palindrome (242545242).
The spelling of 141025101 in words is "one hundred forty-one million, twenty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •