Base | Representation |
---|---|
bin | 100110010110000101100… |
… | …111011010001101001101 |
3 | 100022220112121222101212210 |
4 | 212112011213122031031 |
5 | 321133044000400013 |
6 | 5334310041021033 |
7 | 361243105663632 |
oct | 46260547321515 |
9 | 10286477871783 |
10 | 2635056653133 |
11 | 92658086a793 |
12 | 366837184779 |
13 | 16163c08ccc8 |
14 | 9177498a189 |
15 | 4882586bcc3 |
hex | 265859da34d |
2635056653133 has 32 divisors (see below), whose sum is σ = 3708246811392. Its totient is φ = 1661090816000.
The previous prime is 2635056653093. The next prime is 2635056653137. The reversal of 2635056653133 is 3313566505362.
2635056653133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2635056653133 - 217 = 2635056522061 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2635056653137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4172191 + ... + 4762067.
It is an arithmetic number, because the mean of its divisors is an integer number (115882712856).
Almost surely, 22635056653133 is an apocalyptic number.
2635056653133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2635056653133 is a deficient number, since it is larger than the sum of its proper divisors (1073190158259).
2635056653133 is a wasteful number, since it uses less digits than its factorization.
2635056653133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590645.
The product of its (nonzero) digits is 4374000, while the sum is 48.
The spelling of 2635056653133 in words is "two trillion, six hundred thirty-five billion, fifty-six million, six hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •