Base | Representation |
---|---|
bin | 100101011000011001011001… |
… | …111000011001010100111001 |
3 | 210120002220010222102002002122 |
4 | 211120121121320121110321 |
5 | 133022044414111043223 |
6 | 1341354135513011025 |
7 | 46425546655431263 |
oct | 4530313170312471 |
9 | 716086128362078 |
10 | 164404266112313 |
11 | 484255042345a7 |
12 | 165327940b3a75 |
13 | 7097342c13cb6 |
14 | 2c852cd472b33 |
15 | 14017eb5145c8 |
hex | 958659e19539 |
164404266112313 has 16 divisors (see below), whose sum is σ = 166098914184192. Its totient is φ = 162710939160000.
The previous prime is 164404266112253. The next prime is 164404266112337. The reversal of 164404266112313 is 313211662404461.
It is a cyclic number.
It is not a de Polignac number, because 164404266112313 - 28 = 164404266112057 is a prime.
It is a super-3 number, since 3×1644042661123133 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (164404266112013) 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 15 ways as a sum of consecutive naturals, for example, 7103832620 + ... + 7103855762.
It is an arithmetic number, because the mean of its divisors is an integer number (10381182136512).
Almost surely, 2164404266112313 is an apocalyptic number.
It is an amenable number.
164404266112313 is a deficient number, since it is larger than the sum of its proper divisors (1694648071879).
164404266112313 is a wasteful number, since it uses less digits than its factorization.
164404266112313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48536.
The product of its (nonzero) digits is 497664, while the sum is 44.
The spelling of 164404266112313 in words is "one hundred sixty-four trillion, four hundred four billion, two hundred sixty-six million, one hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •