Base | Representation |
---|---|
bin | 100000111101110001100… |
… | …001011000100001111111 |
3 | 22000120021022002110121221 |
4 | 200331301201120201333 |
5 | 244103420144413011 |
6 | 4452404414334211 |
7 | 322444354123231 |
oct | 40756141304177 |
9 | 8016238073557 |
10 | 2265352341631 |
11 | 7a3804380585 |
12 | 307059aba367 |
13 | 135811165282 |
14 | 7b902202251 |
15 | 3ddd8a08971 |
hex | 20f7185887f |
2265352341631 has 8 divisors (see below), whose sum is σ = 2326742936640. Its totient is φ = 2203970423328.
The previous prime is 2265352341601. The next prime is 2265352341653. The reversal of 2265352341631 is 1361432535622.
2265352341631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2265352341631 - 27 = 2265352341503 is a prime.
It is a super-2 number, since 2×22653523416312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2265352341601) 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, 1638196 + ... + 2685961.
It is an arithmetic number, because the mean of its divisors is an integer number (290842867080).
Almost surely, 22265352341631 is an apocalyptic number.
2265352341631 is a deficient number, since it is larger than the sum of its proper divisors (61390595009).
2265352341631 is a wasteful number, since it uses less digits than its factorization.
2265352341631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4338353.
The product of its digits is 777600, while the sum is 43.
The spelling of 2265352341631 in words is "two trillion, two hundred sixty-five billion, three hundred fifty-two million, three hundred forty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •