Base | Representation |
---|---|
bin | 111100001001001011000011… |
… | …010011010110111001111011 |
3 | 1021200120012122000002021201220 |
4 | 330021023003103112321323 |
5 | 234132240343411220011 |
6 | 2334323353332443123 |
7 | 106500305003043342 |
oct | 7411130323267173 |
9 | 1250505560067656 |
10 | 264513132523131 |
11 | 77311431514518 |
12 | 25800500a794a3 |
13 | b4796347455bb |
14 | 494670aaa4b59 |
15 | 208a8d860d506 |
hex | f092c34d6e7b |
264513132523131 has 8 divisors (see below), whose sum is σ = 353445913582080. Its totient is φ = 175961219906472.
The previous prime is 264513132523127. The next prime is 264513132523139. The reversal of 264513132523131 is 131325231315462.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 264513132523131 - 22 = 264513132523127 is a prime.
It is a super-2 number, since 2×2645131325231312 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (264513132523139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95217108951 + ... + 95217111728.
It is an arithmetic number, because the mean of its divisors is an integer number (44180739197760).
Almost surely, 2264513132523131 is an apocalyptic number.
264513132523131 is a deficient number, since it is larger than the sum of its proper divisors (88932781058949).
264513132523131 is a wasteful number, since it uses less digits than its factorization.
264513132523131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190434221145.
The product of its digits is 388800, while the sum is 42.
Adding to 264513132523131 its reverse (131325231315462), we get a palindrome (395838363838593).
The spelling of 264513132523131 in words is "two hundred sixty-four trillion, five hundred thirteen billion, one hundred thirty-two million, five hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •