Base | Representation |
---|---|
bin | 1011111000110101110000… |
… | …10011101100000111000101 |
3 | 10102120011202021011222121120 |
4 | 11330122320103230013011 |
5 | 11411303323330220423 |
6 | 131333331225504153 |
7 | 5335500436143465 |
oct | 574327023540705 |
9 | 112504667158546 |
10 | 26142263132613 |
11 | 8369965013661 |
12 | 2b22667042059 |
13 | 117828803cc34 |
14 | 66541406bba5 |
15 | 30504857cee3 |
hex | 17c6b84ec1c5 |
26142263132613 has 8 divisors (see below), whose sum is σ = 36690895624800. Its totient is φ = 16510903031088.
The previous prime is 26142263132603. The next prime is 26142263132627. The reversal of 26142263132613 is 31623136224162.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 26142263132613 - 24 = 26142263132597 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26142263132603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229318097598 + ... + 229318097711.
It is an arithmetic number, because the mean of its divisors is an integer number (4586361953100).
Almost surely, 226142263132613 is an apocalyptic number.
It is an amenable number.
26142263132613 is a deficient number, since it is larger than the sum of its proper divisors (10548632492187).
26142263132613 is a wasteful number, since it uses less digits than its factorization.
26142263132613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458636195331.
The product of its digits is 373248, while the sum is 42.
Adding to 26142263132613 its reverse (31623136224162), we get a palindrome (57765399356775).
The spelling of 26142263132613 in words is "twenty-six trillion, one hundred forty-two billion, two hundred sixty-three million, one hundred thirty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •