Base | Representation |
---|---|
bin | 1000010011100100001… |
… | …0000101101101100111 |
3 | 111122022100212010221201 |
4 | 2010321002011231213 |
5 | 4314212314113032 |
6 | 145315022223331 |
7 | 13211003350060 |
oct | 2047102055547 |
9 | 448270763851 |
10 | 142690769767 |
11 | 55573246307 |
12 | 237a2a24b47 |
13 | 105c0196360 |
14 | 6c98b3b567 |
15 | 3aa20818e7 |
hex | 2139085b67 |
142690769767 has 128 divisors (see below), whose sum is σ = 192453459968. Its totient is φ = 102792499200.
The previous prime is 142690769729. The next prime is 142690769821. The reversal of 142690769767 is 767967096241.
It is a cyclic number.
It is not a de Polignac number, because 142690769767 - 211 = 142690767719 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142690769699 and 142690769708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142690769717) 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 127 ways as a sum of consecutive naturals, for example, 464790628 + ... + 464790934.
It is an arithmetic number, because the mean of its divisors is an integer number (1503542656).
Almost surely, 2142690769767 is an apocalyptic number.
142690769767 is a deficient number, since it is larger than the sum of its proper divisors (49762690201).
142690769767 is a wasteful number, since it uses less digits than its factorization.
142690769767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529.
The product of its (nonzero) digits is 48009024, while the sum is 64.
The spelling of 142690769767 in words is "one hundred forty-two billion, six hundred ninety million, seven hundred sixty-nine thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •