Base | Representation |
---|---|
bin | 10000110011111… |
… | …01000000011101 |
3 | 100211100121201220 |
4 | 20121331000131 |
5 | 242100134323 |
6 | 21554323553 |
7 | 3331442364 |
oct | 1031750035 |
9 | 324317656 |
10 | 141021213 |
11 | 7266a363 |
12 | 3b2895b9 |
13 | 232a7108 |
14 | 14a2c7db |
15 | c5a90e3 |
hex | 867d01d |
141021213 has 4 divisors (see below), whose sum is σ = 188028288. Its totient is φ = 94014140.
The previous prime is 141021187. The next prime is 141021259. The reversal of 141021213 is 312120141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 141021213 - 29 = 141020701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141021192 and 141021201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141020213) by changing a digit.
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, 23503533 + ... + 23503538.
It is an arithmetic number, because the mean of its divisors is an integer number (47007072).
Almost surely, 2141021213 is an apocalyptic number.
It is an amenable number.
141021213 is a deficient number, since it is larger than the sum of its proper divisors (47007075).
141021213 is an equidigital number, since it uses as much as digits as its factorization.
141021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47007074.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 141021213 is about 11875.2352818797. The cubic root of 141021213 is about 520.5088866886.
Adding to 141021213 its reverse (312120141), we get a palindrome (453141354).
The spelling of 141021213 in words is "one hundred forty-one million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •