Base | Representation |
---|---|
bin | 1000010011010011101… |
… | …1100110001010011011 |
3 | 111122010120101012001210 |
4 | 2010310323212022123 |
5 | 4314042210140221 |
6 | 145304123314203 |
7 | 13206206435043 |
oct | 2046473461233 |
9 | 448116335053 |
10 | 142621958811 |
11 | 55538417652 |
12 | 2378397b963 |
13 | 105abb52b07 |
14 | 6c8d948723 |
15 | 3a9aedd276 |
hex | 2134ee629b |
142621958811 has 4 divisors (see below), whose sum is σ = 190162611752. Its totient is φ = 95081305872.
The previous prime is 142621958803. The next prime is 142621958837. The reversal of 142621958811 is 118859126241.
142621958811 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 142621958811 - 23 = 142621958803 is a prime.
It is a super-3 number, since 3×1426219588113 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142621958911) 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 3 ways as a sum of consecutive naturals, for example, 23770326466 + ... + 23770326471.
It is an arithmetic number, because the mean of its divisors is an integer number (47540652938).
Almost surely, 2142621958811 is an apocalyptic number.
142621958811 is a deficient number, since it is larger than the sum of its proper divisors (47540652941).
142621958811 is an equidigital number, since it uses as much as digits as its factorization.
142621958811 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47540652940.
The product of its digits is 276480, while the sum is 48.
The spelling of 142621958811 in words is "one hundred forty-two billion, six hundred twenty-one million, nine hundred fifty-eight thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •