Base | Representation |
---|---|
bin | 1010001001010110000101… |
… | …00000000010000010111001 |
3 | 2220222221102111001020201110 |
4 | 11010223002200002002321 |
5 | 10411022042231443223 |
6 | 115241402550110533 |
7 | 4461640251020550 |
oct | 504530240020271 |
9 | 86887374036643 |
10 | 22311323312313 |
11 | 71221a739a272 |
12 | 260410104b449 |
13 | c5ac445720b9 |
14 | 571c33a40d97 |
15 | 28a57e677d93 |
hex | 144ac28020b9 |
22311323312313 has 8 divisors (see below), whose sum is σ = 33998206952128. Its totient is φ = 12749327607024.
The previous prime is 22311323312287. The next prime is 22311323312321. The reversal of 22311323312313 is 31321332311322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22311323312313 - 25 = 22311323312281 is a prime.
It is a super-3 number, since 3×223113233123133 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22311323312393) 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, 531221983606 + ... + 531221983647.
It is an arithmetic number, because the mean of its divisors is an integer number (4249775869016).
Almost surely, 222311323312313 is an apocalyptic number.
It is an amenable number.
22311323312313 is a deficient number, since it is larger than the sum of its proper divisors (11686883639815).
22311323312313 is a wasteful number, since it uses less digits than its factorization.
22311323312313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1062443967263.
The product of its digits is 11664, while the sum is 30.
Adding to 22311323312313 its reverse (31321332311322), we get a palindrome (53632655623635).
The spelling of 22311323312313 in words is "twenty-two trillion, three hundred eleven billion, three hundred twenty-three million, three hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •