Base | Representation |
---|---|
bin | 100110111011111010010… |
… | …111100100010011010001 |
3 | 100110210101001102022022021 |
4 | 212323322113210103101 |
5 | 322314233023440423 |
6 | 5405104053011441 |
7 | 364211412635335 |
oct | 46737227442321 |
9 | 10423331368267 |
10 | 2675670140113 |
11 | 941822048663 |
12 | 372690623b81 |
13 | 165412280bc9 |
14 | 937088117c5 |
15 | 4990113795d |
hex | 26efa5e44d1 |
2675670140113 has 2 divisors, whose sum is σ = 2675670140114. Its totient is φ = 2675670140112.
The previous prime is 2675670140029. The next prime is 2675670140147. The reversal of 2675670140113 is 3110410765762.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2254478226064 + 421191914049 = 1501492^2 + 648993^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2675670140113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2675670140113.
It is not a weakly prime, because it can be changed into another prime (2675670120113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1337835070056 + 1337835070057.
It is an arithmetic number, because the mean of its divisors is an integer number (1337835070057).
Almost surely, 22675670140113 is an apocalyptic number.
It is an amenable number.
2675670140113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2675670140113 is an equidigital number, since it uses as much as digits as its factorization.
2675670140113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 211680, while the sum is 43.
The spelling of 2675670140113 in words is "two trillion, six hundred seventy-five billion, six hundred seventy million, one hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.266 sec. • engine limits •