Base | Representation |
---|---|
bin | 11111100011001… |
… | …00100101001011 |
3 | 200102222202211211 |
4 | 33301210211023 |
5 | 1020222400011 |
6 | 42132233551 |
7 | 6362341321 |
oct | 1761444513 |
9 | 612882754 |
10 | 264653131 |
11 | 1264318a6 |
12 | 7476b8b7 |
13 | 42aa31b2 |
14 | 27211d11 |
15 | 1837ab21 |
hex | fc6494b |
264653131 has 4 divisors (see below), whose sum is σ = 264864600. Its totient is φ = 264441664.
The previous prime is 264653117. The next prime is 264653153. The reversal of 264653131 is 131356462.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 264653131 - 217 = 264522059 is a prime.
It is a super-2 number, since 2×2646531312 = 140082559496206322, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 264653093 and 264653102.
It is not an unprimeable number, because it can be changed into a prime (264651131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 103846 + ... + 106363.
It is an arithmetic number, because the mean of its divisors is an integer number (66216150).
Almost surely, 2264653131 is an apocalyptic number.
264653131 is a deficient number, since it is larger than the sum of its proper divisors (211469).
264653131 is a wasteful number, since it uses less digits than its factorization.
264653131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211468.
The product of its digits is 12960, while the sum is 31.
The square root of 264653131 is about 16268.1631108125. The cubic root of 264653131 is about 642.0354556105.
The spelling of 264653131 in words is "two hundred sixty-four million, six hundred fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •