Base | Representation |
---|---|
bin | 10000111101000… |
… | …10101101010101 |
3 | 100220121201221110 |
4 | 20132202231111 |
5 | 242402133323 |
6 | 22040205233 |
7 | 3344612565 |
oct | 1036425525 |
9 | 326551843 |
10 | 142224213 |
11 | 7331117a |
12 | 3b769819 |
13 | 23608851 |
14 | 14c62da5 |
15 | c745793 |
hex | 87a2b55 |
142224213 has 8 divisors (see below), whose sum is σ = 191587648. Its totient is φ = 93838464.
The previous prime is 142224191. The next prime is 142224223. The reversal of 142224213 is 312422241.
142224213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142224213 - 29 = 142223701 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 142224213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142224223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244081 + ... + 244662.
It is an arithmetic number, because the mean of its divisors is an integer number (23948456).
Almost surely, 2142224213 is an apocalyptic number.
It is an amenable number.
142224213 is a deficient number, since it is larger than the sum of its proper divisors (49363435).
142224213 is an equidigital number, since it uses as much as digits as its factorization.
142224213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488843.
The product of its digits is 768, while the sum is 21.
The square root of 142224213 is about 11925.7793456025. The cubic root of 142224213 is about 521.9847876543.
Adding to 142224213 its reverse (312422241), we get a palindrome (454646454).
The spelling of 142224213 in words is "one hundred forty-two million, two hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •