Base | Representation |
---|---|
bin | 1011111000000100100010… |
… | …11001111011101010000100 |
3 | 10102110122112211121222220221 |
4 | 11330002101121323222010 |
5 | 11410340220201411311 |
6 | 131313241312234124 |
7 | 5333543606605144 |
oct | 574022131735204 |
9 | 112418484558827 |
10 | 26115840653956 |
11 | 8359736235339 |
12 | 2b1951223b944 |
13 | 1175936bb7591 |
14 | 664028c00924 |
15 | 3044eda75671 |
hex | 17c09167ba84 |
26115840653956 has 81 divisors (see below), whose sum is σ = 47911056551631. Its totient is φ = 12455719907904.
The previous prime is 26115840653951. The next prime is 26115840653977. The reversal of 26115840653956 is 65935604851162.
The square root of 26115840653956 is 5110366.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 10425368999556 + 15690471654400 = 3228834^2 + 3961120^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26115840653894 and 26115840653903.
It is not an unprimeable number, because it can be changed into a prime (26115840653951) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 20042854801 + ... + 20042856103.
Almost surely, 226115840653956 is an apocalyptic number.
26115840653956 is the 5110366-th square number.
It is an amenable number.
26115840653956 is a deficient number, since it is larger than the sum of its proper divisors (21795215897675).
26115840653956 is an frugal number, since it uses more digits than its factorization.
26115840653956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2790 (or 1395 counting only the distinct ones).
The product of its (nonzero) digits is 46656000, while the sum is 61.
The spelling of 26115840653956 in words is "twenty-six trillion, one hundred fifteen billion, eight hundred forty million, six hundred fifty-three thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •