Base | Representation |
---|---|
bin | 1000010010111000001… |
… | …0011100111101011101 |
3 | 111121211111202220102101 |
4 | 2010232002130331131 |
5 | 4313323104044423 |
6 | 145244432525101 |
7 | 13203303460624 |
oct | 2045602347535 |
9 | 447744686371 |
10 | 142506315613 |
11 | 55489111162 |
12 | 237510b0791 |
13 | 10590bc2c9c |
14 | 6c7c4446bb |
15 | 3a90c987ad |
hex | 212e09cf5d |
142506315613 has 8 divisors (see below), whose sum is σ = 147109248000. Its totient is φ = 137903755440.
The previous prime is 142506315569. The next prime is 142506315647. The reversal of 142506315613 is 316513605241.
142506315613 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 a de Polignac number, because none of the positive numbers 2k-142506315613 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 (142506315113) 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, 830763 + ... + 987511.
It is an arithmetic number, because the mean of its divisors is an integer number (18388656000).
Almost surely, 2142506315613 is an apocalyptic number.
It is an amenable number.
142506315613 is a deficient number, since it is larger than the sum of its proper divisors (4602932387).
142506315613 is a wasteful number, since it uses less digits than its factorization.
142506315613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186107.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 142506315613 in words is "one hundred forty-two billion, five hundred six million, three hundred fifteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •