Base | Representation |
---|---|
bin | 1000010010111100011… |
… | …1000111010110011001 |
3 | 111121212202122100222120 |
4 | 2010233013013112121 |
5 | 4313342211040113 |
6 | 145250314411453 |
7 | 13203612455232 |
oct | 2045707072631 |
9 | 447782570876 |
10 | 142524315033 |
11 | 55498295411 |
12 | 23757130b89 |
13 | 10594855929 |
14 | 6c809ac089 |
15 | 3a92651a23 |
hex | 212f1c7599 |
142524315033 has 8 divisors (see below), whose sum is σ = 190035436896. Its totient is φ = 95014701600.
The previous prime is 142524314993. The next prime is 142524315077. The reversal of 142524315033 is 330513425241.
142524315033 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 142524315033 - 217 = 142524183961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142524314985 and 142524315003.
It is not an unprimeable number, because it can be changed into a prime (142526315033) 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, 134308 + ... + 550533.
It is an arithmetic number, because the mean of its divisors is an integer number (23754429612).
Almost surely, 2142524315033 is an apocalyptic number.
It is an amenable number.
142524315033 is a deficient number, since it is larger than the sum of its proper divisors (47511121863).
142524315033 is an equidigital number, since it uses as much as digits as its factorization.
142524315033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754215.
The product of its (nonzero) digits is 43200, while the sum is 33.
The spelling of 142524315033 in words is "one hundred forty-two billion, five hundred twenty-four million, three hundred fifteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •