Base | Representation |
---|---|
bin | 111011011100100111010001… |
… | …010100100011011011100001 |
3 | 1021021201110212121221201002020 |
4 | 323130213101110203123201 |
5 | 233232103230321114203 |
6 | 2324020542414412053 |
7 | 106033133620253016 |
oct | 7334472124433341 |
9 | 1237643777851066 |
10 | 261451056035553 |
11 | 7634085213194a |
12 | 253a6b71801029 |
13 | b2b6962210757 |
14 | 487c42762d70d |
15 | 2035e1e1e6153 |
hex | edc9d15236e1 |
261451056035553 has 16 divisors (see below), whose sum is σ = 349936275701760. Its totient is φ = 173634376138704.
The previous prime is 261451056035509. The next prime is 261451056035567. The reversal of 261451056035553 is 355530650154162.
It is not a de Polignac number, because 261451056035553 - 221 = 261451053938401 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 261451056035496 and 261451056035505.
It is not an unprimeable number, because it can be changed into a prime (261451056035453) 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, 137296543 + ... + 139187796.
It is an arithmetic number, because the mean of its divisors is an integer number (21871017231360).
Almost surely, 2261451056035553 is an apocalyptic number.
It is an amenable number.
261451056035553 is a deficient number, since it is larger than the sum of its proper divisors (88485219666207).
261451056035553 is a wasteful number, since it uses less digits than its factorization.
261451056035553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276485548.
The product of its (nonzero) digits is 8100000, while the sum is 51.
The spelling of 261451056035553 in words is "two hundred sixty-one trillion, four hundred fifty-one billion, fifty-six million, thirty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.441 sec. • engine limits •