Base | Representation |
---|---|
bin | 100001110001111011010… |
… | …100000110011010000011 |
3 | 22012220210221211112212021 |
4 | 201301323110012122003 |
5 | 301013111402102111 |
6 | 4534225232342311 |
7 | 326466150456100 |
oct | 41617324063203 |
9 | 8186727745767 |
10 | 2321351206531 |
11 | 815530269615 |
12 | 315a879a4997 |
13 | 13ab969941a6 |
14 | 804d5527aa7 |
15 | 405b4d5ed71 |
hex | 21c7b506683 |
2321351206531 has 12 divisors (see below), whose sum is σ = 2704301017272. Its totient is φ = 1986816356448.
The previous prime is 2321351206487. The next prime is 2321351206589. The reversal of 2321351206531 is 1356021531232.
It is not a de Polignac number, because 2321351206531 - 213 = 2321351198339 is a prime.
It is a super-2 number, since 2×23213512065312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2321351246531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34647730 + ... + 34714663.
It is an arithmetic number, because the mean of its divisors is an integer number (225358418106).
Almost surely, 22321351206531 is an apocalyptic number.
2321351206531 is a deficient number, since it is larger than the sum of its proper divisors (382949810741).
2321351206531 is an equidigital number, since it uses as much as digits as its factorization.
2321351206531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69363090 (or 69363083 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 2321351206531 its reverse (1356021531232), we get a palindrome (3677372737763).
The spelling of 2321351206531 in words is "two trillion, three hundred twenty-one billion, three hundred fifty-one million, two hundred six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.542 sec. • engine limits •