Base | Representation |
---|---|
bin | 100101010100010101110011… |
… | …111111110000110101111111 |
3 | 210112010020200110211102111012 |
4 | 211110111303333300311333 |
5 | 133003013042013031043 |
6 | 1341022121144145435 |
7 | 46366451445323126 |
oct | 4524256377606577 |
9 | 715106613742435 |
10 | 164125531377023 |
11 | 4832827979a437 |
12 | 164a876446827b |
13 | 7076c81955878 |
14 | 2c75a0a694abd |
15 | 13e9435beea18 |
hex | 954573ff0d7f |
164125531377023 has 16 divisors (see below), whose sum is σ = 169816344445440. Its totient is φ = 158520921873600.
The previous prime is 164125531377001. The next prime is 164125531377029. The reversal of 164125531377023 is 320773135521461.
It is a cyclic number.
It is not a de Polignac number, because 164125531377023 - 28 = 164125531376767 is a prime.
It is a super-2 number, since 2×1641255313770232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164125531377029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34214615 + ... + 38715512.
It is an arithmetic number, because the mean of its divisors is an integer number (10613521527840).
Almost surely, 2164125531377023 is an apocalyptic number.
164125531377023 is a deficient number, since it is larger than the sum of its proper divisors (5690813068417).
164125531377023 is a wasteful number, since it uses less digits than its factorization.
164125531377023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72930718.
The product of its (nonzero) digits is 3175200, while the sum is 50.
Adding to 164125531377023 its reverse (320773135521461), we get a palindrome (484898666898484).
The spelling of 164125531377023 in words is "one hundred sixty-four trillion, one hundred twenty-five billion, five hundred thirty-one million, three hundred seventy-seven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •