Base | Representation |
---|---|
bin | 1011111111011011011011… |
… | …10111101101111010010101 |
3 | 10110100211002101102002012111 |
4 | 11333231231313231322111 |
5 | 11424010442233141121 |
6 | 132025331153351021 |
7 | 5361033445025101 |
oct | 577555567557225 |
9 | 113324071362174 |
10 | 26368647552661 |
11 | 8446976129087 |
12 | 2b5a506868471 |
13 | 119372564a77b |
14 | 67236c310901 |
15 | 30ad97edd2e1 |
hex | 17fb6ddede95 |
26368647552661 has 8 divisors (see below), whose sum is σ = 26878788469080. Its totient is φ = 25858974016512.
The previous prime is 26368647552647. The next prime is 26368647552673. The reversal of 26368647552661 is 16625574686362.
It can be written as a sum of positive squares in 4 ways, for example, as 8674055780625 + 17694591772036 = 2945175^2 + 4206494^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26368647552661 - 225 = 26368613998229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26368647552061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116731140 + ... + 116956813.
It is an arithmetic number, because the mean of its divisors is an integer number (3359848558635).
Almost surely, 226368647552661 is an apocalyptic number.
It is an amenable number.
26368647552661 is a deficient number, since it is larger than the sum of its proper divisors (510140916419).
26368647552661 is a wasteful number, since it uses less digits than its factorization.
26368647552661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233690135.
The product of its digits is 522547200, while the sum is 67.
The spelling of 26368647552661 in words is "twenty-six trillion, three hundred sixty-eight billion, six hundred forty-seven million, five hundred fifty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •