Base | Representation |
---|---|
bin | 1000010010111010100… |
… | …0101010000001101111 |
3 | 111121212012121201102002 |
4 | 2010232220222001233 |
5 | 4313333140034412 |
6 | 145245431322515 |
7 | 13203454552100 |
oct | 2045650520157 |
9 | 447765551362 |
10 | 142516330607 |
11 | 55493831612 |
12 | 2375452043b |
13 | 10592cbb611 |
14 | 6c7d8d03a7 |
15 | 3a91ac5dc2 |
hex | 212ea2a06f |
142516330607 has 6 divisors (see below), whose sum is σ = 165784303008. Its totient is φ = 122156854764.
The previous prime is 142516330601. The next prime is 142516330613. The reversal of 142516330607 is 706033615241.
It is an interprime number because it is at equal distance from previous prime (142516330601) and next prime (142516330613).
It is not a de Polignac number, because 142516330607 - 216 = 142516265071 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 (142516330601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1454248223 + ... + 1454248320.
It is an arithmetic number, because the mean of its divisors is an integer number (27630717168).
Almost surely, 2142516330607 is an apocalyptic number.
142516330607 is a deficient number, since it is larger than the sum of its proper divisors (23267972401).
142516330607 is an equidigital number, since it uses as much as digits as its factorization.
142516330607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2908496557 (or 2908496550 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 142516330607 its reverse (706033615241), we get a palindrome (848549945848).
The spelling of 142516330607 in words is "one hundred forty-two billion, five hundred sixteen million, three hundred thirty thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •