Base | Representation |
---|---|
bin | 100110010011010101101… |
… | …110000011110001011001 |
3 | 100022121220222001200120110 |
4 | 212103111232003301121 |
5 | 321111023013344413 |
6 | 5333101141514533 |
7 | 361110013335435 |
oct | 46232556036131 |
9 | 10277828050513 |
10 | 2632105606233 |
11 | 9252a6aa5554 |
12 | 366152a12a49 |
13 | 16128b8884cc |
14 | 91574a879c5 |
15 | 487017478c3 |
hex | 264d5b83c59 |
2632105606233 has 16 divisors (see below), whose sum is σ = 3598531372800. Its totient is φ = 1710290843520.
The previous prime is 2632105606223. The next prime is 2632105606241. The reversal of 2632105606233 is 3326065012362.
2632105606233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2632105606233 - 25 = 2632105606201 is a prime.
It is a super-3 number, since 3×26321056062333 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2632105606191 and 2632105606200.
It is not an unprimeable number, because it can be changed into a prime (2632105606223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10170198 + ... + 10425791.
It is an arithmetic number, because the mean of its divisors is an integer number (224908210800).
Almost surely, 22632105606233 is an apocalyptic number.
It is an amenable number.
2632105606233 is a deficient number, since it is larger than the sum of its proper divisors (966425766567).
2632105606233 is a wasteful number, since it uses less digits than its factorization.
2632105606233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20597072.
The product of its (nonzero) digits is 233280, while the sum is 39.
The spelling of 2632105606233 in words is "two trillion, six hundred thirty-two billion, one hundred five million, six hundred six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •