Base | Representation |
---|---|
bin | 100110101110100100001… |
… | …110111100001001100011 |
3 | 100102102101100222200020111 |
4 | 212232210032330021203 |
5 | 322100411033323120 |
6 | 5354334111152151 |
7 | 363163326623650 |
oct | 46564416741143 |
9 | 10372340880214 |
10 | 2661340136035 |
11 | 936739142489 |
12 | 36b951515657 |
13 | 163c6a49a459 |
14 | 92b49594c27 |
15 | 4936306a75a |
hex | 26ba43bc263 |
2661340136035 has 8 divisors (see below), whose sum is σ = 3649837900896. Its totient is φ = 1824918950400.
The previous prime is 2661340136029. The next prime is 2661340136041. The reversal of 2661340136035 is 5306310431662.
2661340136035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2661340136029) and next prime (2661340136041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2661340136035 - 231 = 2659192652387 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38019144766 + ... + 38019144835.
It is an arithmetic number, because the mean of its divisors is an integer number (456229737612).
Almost surely, 22661340136035 is an apocalyptic number.
2661340136035 is a deficient number, since it is larger than the sum of its proper divisors (988497764861).
2661340136035 is an equidigital number, since it uses as much as digits as its factorization.
2661340136035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76038289613.
The product of its (nonzero) digits is 233280, while the sum is 40.
Adding to 2661340136035 its reverse (5306310431662), we get a palindrome (7967650567697).
The spelling of 2661340136035 in words is "two trillion, six hundred sixty-one billion, three hundred forty million, one hundred thirty-six thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •