Base | Representation |
---|---|
bin | 1000010001000100100… |
… | …0110011111101101111 |
3 | 111120120201101211211201 |
4 | 2010101020303331233 |
5 | 4311324442142224 |
6 | 145124352230331 |
7 | 13155265231261 |
oct | 2042110637557 |
9 | 446521354751 |
10 | 142021443439 |
11 | 5525a447557 |
12 | 2363683b3a7 |
13 | 10514606785 |
14 | 6c33ca9b31 |
15 | 3a6341ca44 |
hex | 2111233f6f |
142021443439 has 2 divisors, whose sum is σ = 142021443440. Its totient is φ = 142021443438.
The previous prime is 142021443413. The next prime is 142021443461. The reversal of 142021443439 is 934344120241.
142021443439 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 142021443439 - 213 = 142021435247 is a prime.
It is a super-2 number, since 2×1420214434392 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142021443398 and 142021443407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142021443539) 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 as a sum of consecutive naturals, namely, 71010721719 + 71010721720.
It is an arithmetic number, because the mean of its divisors is an integer number (71010721720).
Almost surely, 2142021443439 is an apocalyptic number.
142021443439 is a deficient number, since it is larger than the sum of its proper divisors (1).
142021443439 is an equidigital number, since it uses as much as digits as its factorization.
142021443439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 142021443439 in words is "one hundred forty-two billion, twenty-one million, four hundred forty-three thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •