Base | Representation |
---|---|
bin | 100001100111101001111… |
… | …000011000111011000111 |
3 | 22011212100021010211020221 |
4 | 201213221320120323013 |
5 | 300323014223431211 |
6 | 4525202535405211 |
7 | 325625626062400 |
oct | 41475170307307 |
9 | 8155307124227 |
10 | 2310321311431 |
11 | 810890172131 |
12 | 313909b23807 |
13 | 139b29800543 |
14 | 7db6a6b49a7 |
15 | 4016b867c71 |
hex | 219e9e18ec7 |
2310321311431 has 12 divisors (see below), whose sum is σ = 2706851287560. Its totient is φ = 1966028818320.
The previous prime is 2310321311429. The next prime is 2310321311449. The reversal of 2310321311431 is 1341131230132.
It is not a de Polignac number, because 2310321311431 - 21 = 2310321311429 is a prime.
It is a super-2 number, since 2×23103213114312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2310321311396 and 2310321311405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2310321311491) 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, 169595400 + ... + 169609021.
It is an arithmetic number, because the mean of its divisors is an integer number (225570940630).
Almost surely, 22310321311431 is an apocalyptic number.
2310321311431 is a deficient number, since it is larger than the sum of its proper divisors (396529976129).
2310321311431 is a wasteful number, since it uses less digits than its factorization.
2310321311431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339204574 (or 339204567 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 2310321311431 its reverse (1341131230132), we get a palindrome (3651452541563).
The spelling of 2310321311431 in words is "two trillion, three hundred ten billion, three hundred twenty-one million, three hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •