Base | Representation |
---|---|
bin | 1000010010011100101… |
… | …0010011111100101011 |
3 | 111121112110122222102220 |
4 | 2010213022103330223 |
5 | 4313104034412324 |
6 | 145225151525123 |
7 | 13200402660162 |
oct | 2044712237453 |
9 | 447473588386 |
10 | 142390935339 |
11 | 55429a75264 |
12 | 2371a5297a3 |
13 | 10573025a33 |
14 | 6c6adac3d9 |
15 | 3a85aa6b79 |
hex | 2127293f2b |
142390935339 has 8 divisors (see below), whose sum is σ = 191811844560. Its totient is φ = 93948658176.
The previous prime is 142390935319. The next prime is 142390935353. The reversal of 142390935339 is 933539093241.
142390935339 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 142390935339 - 220 = 142389886763 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142390935291 and 142390935300.
It is not an unprimeable number, because it can be changed into a prime (142390935319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244657674 + ... + 244658255.
It is an arithmetic number, because the mean of its divisors is an integer number (23976480570).
Almost surely, 2142390935339 is an apocalyptic number.
142390935339 is a deficient number, since it is larger than the sum of its proper divisors (49420909221).
142390935339 is an equidigital number, since it uses as much as digits as its factorization.
142390935339 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489316029.
The product of its (nonzero) digits is 2361960, while the sum is 51.
The spelling of 142390935339 in words is "one hundred forty-two billion, three hundred ninety million, nine hundred thirty-five thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •