Base | Representation |
---|---|
bin | 1000010010001100001… |
… | …1011010111010110111 |
3 | 111121100122222201101210 |
4 | 2010203003122322313 |
5 | 4312433414120043 |
6 | 145214250452503 |
7 | 13165605131661 |
oct | 2044303327267 |
9 | 447318881353 |
10 | 142322020023 |
11 | 553a4085157 |
12 | 236bb434133 |
13 | 10561976b41 |
14 | 6c61b8d531 |
15 | 3a7e9e2633 |
hex | 21230daeb7 |
142322020023 has 4 divisors (see below), whose sum is σ = 189762693368. Its totient is φ = 94881346680.
The previous prime is 142322020019. The next prime is 142322020063. The reversal of 142322020023 is 320020223241.
142322020023 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 142322020023 - 22 = 142322020019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142322020063) 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, 23720336668 + ... + 23720336673.
It is an arithmetic number, because the mean of its divisors is an integer number (47440673342).
Almost surely, 2142322020023 is an apocalyptic number.
142322020023 is a deficient number, since it is larger than the sum of its proper divisors (47440673345).
142322020023 is an equidigital number, since it uses as much as digits as its factorization.
142322020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47440673344.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 142322020023 its reverse (320020223241), we get a palindrome (462342243264).
The spelling of 142322020023 in words is "one hundred forty-two billion, three hundred twenty-two million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •