Base | Representation |
---|---|
bin | 111100001000000001111101… |
… | …000101110000011000110110 |
3 | 1021200021201001002020011102200 |
4 | 330020001331011300120312 |
5 | 234124444123124003141 |
6 | 2334223333211445330 |
7 | 106461526006231452 |
oct | 7410017505603066 |
9 | 1250251032204380 |
10 | 264434645141046 |
11 | 77291115426696 |
12 | 257a9257756846 |
13 | b472106b00093 |
14 | 49429c2b95662 |
15 | 2088842d2cab6 |
hex | f0807d170636 |
264434645141046 has 24 divisors (see below), whose sum is σ = 573044722858920. Its totient is φ = 88129036833696.
The previous prime is 264434645141041. The next prime is 264434645141057. The reversal of 264434645141046 is 640141546434462.
264434645141046 is a `hidden beast` number, since 2 + 6 + 4 + 43 + 46 + 4 + 514 + 1 + 0 + 46 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 264434645140983 and 264434645141001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264434645141041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1320303751 + ... + 1320504018.
It is an arithmetic number, because the mean of its divisors is an integer number (23876863452455).
Almost surely, 2264434645141046 is an apocalyptic number.
264434645141046 is an abundant number, since it is smaller than the sum of its proper divisors (308610077717874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264434645141046 is a wasteful number, since it uses less digits than its factorization.
264434645141046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2640813340 (or 2640813337 counting only the distinct ones).
The product of its (nonzero) digits is 26542080, while the sum is 54.
The spelling of 264434645141046 in words is "two hundred sixty-four trillion, four hundred thirty-four billion, six hundred forty-five million, one hundred forty-one thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •