Base | Representation |
---|---|
bin | 1000010001000100111… |
… | …0110101101011011011 |
3 | 111120120211101010000221 |
4 | 2010101032311223123 |
5 | 4311330343221243 |
6 | 145124450140511 |
7 | 13155314531326 |
oct | 2042116655333 |
9 | 446524333027 |
10 | 142023023323 |
11 | 55260326545 |
12 | 23637281737 |
13 | 10514a3a90c |
14 | 6c3419b7bd |
15 | 3a63630bed |
hex | 21113b5adb |
142023023323 has 4 divisors (see below), whose sum is σ = 143618787720. Its totient is φ = 140427258928.
The previous prime is 142023023287. The next prime is 142023023369. The reversal of 142023023323 is 323320320241.
142023023323 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 a cyclic number.
It is not a de Polignac number, because 142023023323 - 233 = 133433088731 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142023023393) 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, 797882065 + ... + 797882242.
It is an arithmetic number, because the mean of its divisors is an integer number (35904696930).
Almost surely, 2142023023323 is an apocalyptic number.
142023023323 is a deficient number, since it is larger than the sum of its proper divisors (1595764397).
142023023323 is an equidigital number, since it uses as much as digits as its factorization.
142023023323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1595764396.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 142023023323 its reverse (323320320241), we get a palindrome (465343343564).
The spelling of 142023023323 in words is "one hundred forty-two billion, twenty-three million, twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •