Base | Representation |
---|---|
bin | 1100000001100111110101… |
… | …10010001001110000010011 |
3 | 10110122000122122111022201021 |
4 | 12000303322302021300103 |
5 | 11431224331142002311 |
6 | 132124115022020311 |
7 | 5366342422231453 |
oct | 600637262116023 |
9 | 113560578438637 |
10 | 26444026125331 |
11 | 8475937398431 |
12 | 2b71042a17697 |
13 | 119a8791a22a9 |
14 | 675c7d3b1d63 |
15 | 30cd0a8d5171 |
hex | 180cfac89c13 |
26444026125331 has 4 divisors (see below), whose sum is σ = 27355889095200. Its totient is φ = 25532163155464.
The previous prime is 26444026125323. The next prime is 26444026125353. The reversal of 26444026125331 is 13352162044462.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 26444026125331 - 23 = 26444026125323 is a prime.
It is a super-2 number, since 2×264440261253312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26444026125371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 455931484891 + ... + 455931484948.
It is an arithmetic number, because the mean of its divisors is an integer number (6838972273800).
Almost surely, 226444026125331 is an apocalyptic number.
26444026125331 is a deficient number, since it is larger than the sum of its proper divisors (911862969869).
26444026125331 is an equidigital number, since it uses as much as digits as its factorization.
26444026125331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 911862969868.
The product of its (nonzero) digits is 829440, while the sum is 43.
Adding to 26444026125331 its reverse (13352162044462), we get a palindrome (39796188169793).
The spelling of 26444026125331 in words is "twenty-six trillion, four hundred forty-four billion, twenty-six million, one hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •