Base | Representation |
---|---|
bin | 111011011101110100000001… |
… | …010101101111100001111101 |
3 | 1021022000100120220220022001020 |
4 | 323131310001111233201331 |
5 | 233234431014301013003 |
6 | 2324122452102534353 |
7 | 106042112044545042 |
oct | 7335640125574175 |
9 | 1238010526808036 |
10 | 261533466032253 |
11 | 763727a1459138 |
12 | 253bab307373b9 |
13 | b2c16667213cc |
14 | 48824044ab1c9 |
15 | 2038144062d53 |
hex | eddd0156f87d |
261533466032253 has 48 divisors (see below), whose sum is σ = 372406930657344. Its totient is φ = 163224232980480.
The previous prime is 261533466032147. The next prime is 261533466032297. The reversal of 261533466032253 is 352230664335162.
It is not a de Polignac number, because 261533466032253 - 29 = 261533466031741 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 261533466032196 and 261533466032205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (261533466032353) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 667115733 + ... + 667507653.
It is an arithmetic number, because the mean of its divisors is an integer number (7758477722028).
Almost surely, 2261533466032253 is an apocalyptic number.
It is an amenable number.
261533466032253 is a deficient number, since it is larger than the sum of its proper divisors (110873464625091).
261533466032253 is a wasteful number, since it uses less digits than its factorization.
261533466032253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 396062 (or 396045 counting only the distinct ones).
The product of its (nonzero) digits is 13996800, while the sum is 51.
The spelling of 261533466032253 in words is "two hundred sixty-one trillion, five hundred thirty-three billion, four hundred sixty-six million, thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.355 sec. • engine limits •