Base | Representation |
---|---|
bin | 10000111011101… |
… | …10100010111010 |
3 | 100220021112210210 |
4 | 20131312202322 |
5 | 242330341242 |
6 | 22032251550 |
7 | 3343230321 |
oct | 1035664272 |
9 | 326245723 |
10 | 142043322 |
11 | 731a8283 |
12 | 3b6a0bb6 |
13 | 23574405 |
14 | 14c170b8 |
15 | c70bd9c |
hex | 87768ba |
142043322 has 8 divisors (see below), whose sum is σ = 284086656. Its totient is φ = 47347772.
The previous prime is 142043309. The next prime is 142043323. The reversal of 142043322 is 223340241.
142043322 is digitally balanced in base 3, 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.
142043322 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (142043323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11836938 + ... + 11836949.
It is an arithmetic number, because the mean of its divisors is an integer number (35510832).
Almost surely, 2142043322 is an apocalyptic number.
142043322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142043322 is a wasteful number, since it uses less digits than its factorization.
142043322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23673892.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 142043322 is about 11918.1928999324. The cubic root of 142043322 is about 521.7633944809.
Adding to 142043322 its reverse (223340241), we get a palindrome (365383563).
It can be divided in two parts, 1420433 and 22, that added together give a triangular number (1420455 = T1685).
The spelling of 142043322 in words is "one hundred forty-two million, forty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •