Base | Representation |
---|---|
bin | 1010001011111011101101… |
… | …00010111101001000100111 |
3 | 2221022102221110201211121120 |
4 | 11011331312202331020213 |
5 | 10414001144242322211 |
6 | 115350310230345023 |
7 | 4501235624444511 |
oct | 505756642751047 |
9 | 87272843654546 |
10 | 22400243323431 |
11 | 7156987423766 |
12 | 26193981bb173 |
13 | c664456cbbac |
14 | 57626b32cbb1 |
15 | 28ca35cc2d06 |
hex | 145f768bd227 |
22400243323431 has 16 divisors (see below), whose sum is σ = 29946239203200. Its totient is φ = 14893872664608.
The previous prime is 22400243323417. The next prime is 22400243323441. The reversal of 22400243323431 is 13432334200422.
It is not a de Polignac number, because 22400243323431 - 222 = 22400239129127 is a prime.
It is a super-2 number, since 2×224002433234312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22400243323392 and 22400243323401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22400243323441) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 120678265 + ... + 120863741.
It is an arithmetic number, because the mean of its divisors is an integer number (1871639950200).
Almost surely, 222400243323431 is an apocalyptic number.
22400243323431 is a deficient number, since it is larger than the sum of its proper divisors (7545995879769).
22400243323431 is a wasteful number, since it uses less digits than its factorization.
22400243323431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292078.
The product of its (nonzero) digits is 82944, while the sum is 33.
Adding to 22400243323431 its reverse (13432334200422), we get a palindrome (35832577523853).
The spelling of 22400243323431 in words is "twenty-two trillion, four hundred billion, two hundred forty-three million, three hundred twenty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •