Base | Representation |
---|---|
bin | 11110010001110001111… |
… | …011101000000000011101 |
3 | 21100220120212021100000122 |
4 | 132101301323220000131 |
5 | 233042210430031122 |
6 | 4231503231404325 |
7 | 303216040006550 |
oct | 36216173500035 |
9 | 7326525240018 |
10 | 2080675627037 |
11 | 73245616a517 |
12 | 2972ba0836a5 |
13 | 12128c6538a7 |
14 | 729c325a697 |
15 | 391ca957142 |
hex | 1e471ee801d |
2080675627037 has 8 divisors (see below), whose sum is σ = 2377979220672. Its totient is φ = 1783388088000.
The previous prime is 2080675627021. The next prime is 2080675627087. The reversal of 2080675627037 is 7307265760802.
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 2080675627037 - 24 = 2080675627021 is a prime.
It is a super-2 number, since 2×20806756270372 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2080675627037.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2080675627087) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3734639 + ... + 4255452.
It is an arithmetic number, because the mean of its divisors is an integer number (297247402584).
Almost surely, 22080675627037 is an apocalyptic number.
It is an amenable number.
2080675627037 is a deficient number, since it is larger than the sum of its proper divisors (297303593635).
2080675627037 is an equidigital number, since it uses as much as digits as its factorization.
2080675627037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8027299.
The product of its (nonzero) digits is 5927040, while the sum is 53.
The spelling of 2080675627037 in words is "two trillion, eighty billion, six hundred seventy-five million, six hundred twenty-seven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •