Base | Representation |
---|---|
bin | 1111011001001000111… |
… | …1011001100000001101 |
3 | 221021120201202212102021 |
4 | 3312102033121200031 |
5 | 13313041301441323 |
6 | 321252434330141 |
7 | 25051142201626 |
oct | 3662217314015 |
9 | 837521685367 |
10 | 264446515213 |
11 | a2173188a21 |
12 | 43302729951 |
13 | 1bc2504754a |
14 | cb2931aa4d |
15 | 6d2b24d05d |
hex | 3d923d980d |
264446515213 has 16 divisors (see below), whose sum is σ = 267833304000. Its totient is φ = 261077959296.
The previous prime is 264446515199. The next prime is 264446515253. The reversal of 264446515213 is 312515644462.
264446515213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-264446515213 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 264446515213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264446515253) 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 15 ways as a sum of consecutive naturals, for example, 63673945 + ... + 63678097.
It is an arithmetic number, because the mean of its divisors is an integer number (16739581500).
Almost surely, 2264446515213 is an apocalyptic number.
It is an amenable number.
264446515213 is a deficient number, since it is larger than the sum of its proper divisors (3386788787).
264446515213 is a wasteful number, since it uses less digits than its factorization.
264446515213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6156.
The product of its digits is 691200, while the sum is 43.
The spelling of 264446515213 in words is "two hundred sixty-four billion, four hundred forty-six million, five hundred fifteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •