Base | Representation |
---|---|
bin | 100101010110010110011011… |
… | …111011111011110110100111 |
3 | 210112121110011112100111220011 |
4 | 211112112123323323312213 |
5 | 133012243413421300110 |
6 | 1341205401420151051 |
7 | 46412441065636414 |
oct | 4526263373736647 |
9 | 715543145314804 |
10 | 164263640415655 |
11 | 48380900741290 |
12 | 1650b488998487 |
13 | 7086cc182a0c1 |
14 | 2c7c58cacd10b |
15 | 13ecd1a8eb48a |
hex | 95659befbda7 |
164263640415655 has 32 divisors (see below), whose sum is σ = 216860888659968. Its totient is φ = 118454928720000.
The previous prime is 164263640415653. The next prime is 164263640415703. The reversal of 164263640415655 is 556514046362461.
It is not a de Polignac number, because 164263640415655 - 21 = 164263640415653 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 164263640415655.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164263640415653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23600524 + ... + 29757553.
It is an arithmetic number, because the mean of its divisors is an integer number (6776902770624).
Almost surely, 2164263640415655 is an apocalyptic number.
164263640415655 is a deficient number, since it is larger than the sum of its proper divisors (52597248244313).
164263640415655 is a wasteful number, since it uses less digits than its factorization.
164263640415655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53358567.
The product of its (nonzero) digits is 62208000, while the sum is 58.
The spelling of 164263640415655 in words is "one hundred sixty-four trillion, two hundred sixty-three billion, six hundred forty million, four hundred fifteen thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •