Base | Representation |
---|---|
bin | 11110000000100000101… |
… | …010100111110100011101 |
3 | 21022010201112211001201022 |
4 | 132000200222213310131 |
5 | 232241221340034031 |
6 | 4215155220453525 |
7 | 301661363506250 |
oct | 36004052476435 |
9 | 7263645731638 |
10 | 2062132346141 |
11 | 7255aaa4a08a |
12 | 2937a3b4a2a5 |
13 | 11c5c59c622a |
14 | 71b4460d097 |
15 | 38992a3697b |
hex | 1e020aa7d1d |
2062132346141 has 8 divisors (see below), whose sum is σ = 2358313998144. Its totient is φ = 1766348523360.
The previous prime is 2062132346089. The next prime is 2062132346171. The reversal of 2062132346141 is 1416432312602.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2062132346141 - 226 = 2062065237277 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 (2062132346171) 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, 99446195 + ... + 99466928.
It is an arithmetic number, because the mean of its divisors is an integer number (294789249768).
Almost surely, 22062132346141 is an apocalyptic number.
It is an amenable number.
2062132346141 is a deficient number, since it is larger than the sum of its proper divisors (296181652003).
2062132346141 is a wasteful number, since it uses less digits than its factorization.
2062132346141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198914611.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 2062132346141 its reverse (1416432312602), we get a palindrome (3478564658743).
The spelling of 2062132346141 in words is "two trillion, sixty-two billion, one hundred thirty-two million, three hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •