Base | Representation |
---|---|
bin | 10000110101100… |
… | …11001101000101 |
3 | 100211202220020211 |
4 | 20122303031011 |
5 | 242124240310 |
6 | 22003155421 |
7 | 3333355525 |
oct | 1032631505 |
9 | 324686224 |
10 | 141243205 |
11 | 72801124 |
12 | 3b375b71 |
13 | 2335417c |
14 | 14a89685 |
15 | c5eec8a |
hex | 86b3345 |
141243205 has 4 divisors (see below), whose sum is σ = 169491852. Its totient is φ = 112994560.
The previous prime is 141243199. The next prime is 141243217. The reversal of 141243205 is 502342141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 502342141 = 7 ⋅71763163.
It can be written as a sum of positive squares in 2 ways, for example, as 94361796 + 46881409 = 9714^2 + 6847^2 .
It is not a de Polignac number, because 141243205 - 23 = 141243197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14124316 + ... + 14124325.
It is an arithmetic number, because the mean of its divisors is an integer number (42372963).
Almost surely, 2141243205 is an apocalyptic number.
It is an amenable number.
141243205 is a deficient number, since it is larger than the sum of its proper divisors (28248647).
141243205 is an equidigital number, since it uses as much as digits as its factorization.
141243205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28248646.
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 141243205 is about 11884.5784527681. The cubic root of 141243205 is about 520.7818674408.
Adding to 141243205 its reverse (502342141), we get a palindrome (643585346).
The spelling of 141243205 in words is "one hundred forty-one million, two hundred forty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •