Base | Representation |
---|---|
bin | 100001100010000100001… |
… | …111111101000110111111 |
3 | 22011021212002221220022200 |
4 | 201202010033331012333 |
5 | 300223222214330011 |
6 | 4522331321242543 |
7 | 325324141261236 |
oct | 41420417750677 |
9 | 8137762856280 |
10 | 2304321245631 |
11 | 8092912a6969 |
12 | 312714633453 |
13 | 1393b1710852 |
14 | 7d75b889b1d |
15 | 3ee19c1a856 |
hex | 218843fd1bf |
2304321245631 has 12 divisors (see below), whose sum is σ = 3329876213352. Its totient is φ = 1535562382896.
The previous prime is 2304321245627. The next prime is 2304321245647. The reversal of 2304321245631 is 1365421234032.
2304321245631 is a `hidden beast` number, since 2 + 3 + 0 + 4 + 3 + 2 + 12 + 4 + 5 + 631 = 666.
It is not a de Polignac number, because 2304321245631 - 22 = 2304321245627 is a prime.
It is a super-2 number, since 2×23043212456312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2304321245531) 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, 54292681 + ... + 54335106.
It is an arithmetic number, because the mean of its divisors is an integer number (277489684446).
Almost surely, 22304321245631 is an apocalyptic number.
2304321245631 is a deficient number, since it is larger than the sum of its proper divisors (1025554967721).
2304321245631 is a wasteful number, since it uses less digits than its factorization.
2304321245631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108630150 (or 108630147 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
Adding to 2304321245631 its reverse (1365421234032), we get a palindrome (3669742479663).
The spelling of 2304321245631 in words is "two trillion, three hundred four billion, three hundred twenty-one million, two hundred forty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •