Base | Representation |
---|---|
bin | 100101111011000100011… |
… | …100100110001101011101 |
3 | 100020010122211100011002001 |
4 | 211323010130212031131 |
5 | 320144140234343003 |
6 | 5313111230202301 |
7 | 356165151416665 |
oct | 45730434461535 |
9 | 10203584304061 |
10 | 2606046012253 |
11 | 915244041922 |
12 | 36109b653391 |
13 | 15b99797a908 |
14 | 901c1abd1a5 |
15 | 47bc8a2161d |
hex | 25ec472635d |
2606046012253 has 4 divisors (see below), whose sum is σ = 2608530327900. Its totient is φ = 2603561696608.
The previous prime is 2606046012239. The next prime is 2606046012287. The reversal of 2606046012253 is 3522106406062.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1321862976729 + 1284183035524 = 1149723^2 + 1133218^2 .
It is a cyclic number.
It is not a de Polignac number, because 2606046012253 - 229 = 2605509141341 is a prime.
It is a super-2 number, since 2×26060460122532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2606086012253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1242156250 + ... + 1242158347.
It is an arithmetic number, because the mean of its divisors is an integer number (652132581975).
Almost surely, 22606046012253 is an apocalyptic number.
It is an amenable number.
2606046012253 is a deficient number, since it is larger than the sum of its proper divisors (2484315647).
2606046012253 is a wasteful number, since it uses less digits than its factorization.
2606046012253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2484315646.
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 2606046012253 in words is "two trillion, six hundred six billion, forty-six million, twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •