Base | Representation |
---|---|
bin | 1100000111110001100110… |
… | …00011101011011010101000 |
3 | 10111101020022022012210210010 |
4 | 12003320303003223122220 |
5 | 11443210301423010011 |
6 | 132405155500251520 |
7 | 5420535150406044 |
oct | 603706303533250 |
9 | 114336268183703 |
10 | 26655423641256 |
11 | 8547557815a83 |
12 | 2ba5bbb540ba0 |
13 | 11b479889a817 |
14 | 6821b507d024 |
15 | 31357e76b1a6 |
hex | 183e330eb6a8 |
26655423641256 has 32 divisors (see below), whose sum is σ = 66639091644000. Its totient is φ = 8885070208320.
The previous prime is 26655423641251. The next prime is 26655423641261. The reversal of 26655423641256 is 65214632455662.
It is an interprime number because it is at equal distance from previous prime (26655423641251) and next prime (26655423641261).
It is a junction number, because it is equal to n+sod(n) for n = 26655423641196 and 26655423641205.
It is not an unprimeable number, because it can be changed into a prime (26655423641251) 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, 1327590 + ... + 7421141.
It is an arithmetic number, because the mean of its divisors is an integer number (2082471613875).
Almost surely, 226655423641256 is an apocalyptic number.
It is an amenable number.
26655423641256 is an abundant number, since it is smaller than the sum of its proper divisors (39983668002744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26655423641256 is a wasteful number, since it uses less digits than its factorization.
26655423641256 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8875689 (or 8875685 counting only the distinct ones).
The product of its digits is 62208000, while the sum is 57.
The spelling of 26655423641256 in words is "twenty-six trillion, six hundred fifty-five billion, four hundred twenty-three million, six hundred forty-one thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •