Base | Representation |
---|---|
bin | 100110000010101100111010… |
… | …001000100010000110010011 |
3 | 210221101211000222020210211202 |
4 | 212002230322020202012103 |
5 | 133412212300120043102 |
6 | 1351501450321501415 |
7 | 50145565054526156 |
oct | 4602547210420623 |
9 | 727354028223752 |
10 | 167311426331027 |
11 | 49346417400500 |
12 | 169220aa1a186b |
13 | 72485274a6574 |
14 | 2d45cb824dc9d |
15 | 145224a434e02 |
hex | 982b3a222193 |
167311426331027 has 12 divisors (see below), whose sum is σ = 183909740991648. Its totient is φ = 152096792509200.
The previous prime is 167311426330987. The next prime is 167311426331099. The reversal of 167311426331027 is 720133624113761.
It is not a de Polignac number, because 167311426331027 - 28 = 167311426330771 is a prime.
It is a super-2 number, since 2×1673114263310272 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (167311426331627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16367099 + ... + 24545972.
It is an arithmetic number, because the mean of its divisors is an integer number (15325811749304).
Almost surely, 2167311426331027 is an apocalyptic number.
167311426331027 is a deficient number, since it is larger than the sum of its proper divisors (16598314660621).
167311426331027 is a wasteful number, since it uses less digits than its factorization.
167311426331027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40946890 (or 40946879 counting only the distinct ones).
The product of its (nonzero) digits is 762048, while the sum is 47.
The spelling of 167311426331027 in words is "one hundred sixty-seven trillion, three hundred eleven billion, four hundred twenty-six million, three hundred thirty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •