Base | Representation |
---|---|
bin | 111100000110100010011010… |
… | …111011001010100011101111 |
3 | 1021122220220021012100120001221 |
4 | 330012202122323022203233 |
5 | 234121304033003403111 |
6 | 2334104250330444211 |
7 | 106451235011000134 |
oct | 7406423273124357 |
9 | 1248826235316057 |
10 | 264332066466031 |
11 | 77251666440913 |
12 | 257913aa293667 |
13 | b465539ca5c45 |
14 | 493ba5148458b |
15 | 2085d3c526371 |
hex | f0689aeca8ef |
264332066466031 has 16 divisors (see below), whose sum is σ = 267032532169728. Its totient is φ = 261633247776000.
The previous prime is 264332066465941. The next prime is 264332066466049. The reversal of 264332066466031 is 130664660233462.
It is a cyclic number.
It is not a de Polignac number, because 264332066466031 - 231 = 264329918982383 is a prime.
It is a super-2 number, since 2×2643320664660312 (a number of 30 digits) contains 22 as substring.
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 264332066466031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264332066466071) 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, 5077716955 + ... + 5077769011.
It is an arithmetic number, because the mean of its divisors is an integer number (16689533260608).
Almost surely, 2264332066466031 is an apocalyptic number.
264332066466031 is a deficient number, since it is larger than the sum of its proper divisors (2700465703697).
264332066466031 is a wasteful number, since it uses less digits than its factorization.
264332066466031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66882.
The product of its (nonzero) digits is 13436928, while the sum is 52.
The spelling of 264332066466031 in words is "two hundred sixty-four trillion, three hundred thirty-two billion, sixty-six million, four hundred sixty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •