Base | Representation |
---|---|
bin | 100110111011111010010… |
… | …111100100110010100001 |
3 | 100110210101001102102001100 |
4 | 212323322113210302201 |
5 | 322314233024021423 |
6 | 5405104053025013 |
7 | 364211412644223 |
oct | 46737227446241 |
9 | 10423331372040 |
10 | 2675670142113 |
11 | 94182204a111 |
12 | 372690625169 |
13 | 165412281aa7 |
14 | 93708812413 |
15 | 49901138343 |
hex | 26efa5e4ca1 |
2675670142113 has 12 divisors (see below), whose sum is σ = 3869463386880. Its totient is φ = 1781654010936.
The previous prime is 2675670142091. The next prime is 2675670142121. The reversal of 2675670142113 is 3112410765762.
2675670142113 is a `hidden beast` number, since 2 + 67 + 567 + 0 + 1 + 4 + 21 + 1 + 3 = 666.
It is not a de Polignac number, because 2675670142113 - 28 = 2675670141857 is a prime.
It is a super-2 number, since 2×26756701421132 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2675670140113) 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 in 11 ways as a sum of consecutive naturals, for example, 177165681 + ... + 177180782.
It is an arithmetic number, because the mean of its divisors is an integer number (322455282240).
Almost surely, 22675670142113 is an apocalyptic number.
It is an amenable number.
2675670142113 is a deficient number, since it is larger than the sum of its proper divisors (1193793244767).
2675670142113 is a wasteful number, since it uses less digits than its factorization.
2675670142113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354347308 (or 354347305 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 45.
The spelling of 2675670142113 in words is "two trillion, six hundred seventy-five billion, six hundred seventy million, one hundred forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •