Base | Representation |
---|---|
bin | 1010001100110011100001… |
… | …11000101010100101110111 |
3 | 2221102022022010012100222211 |
4 | 11012121300320222211313 |
5 | 10414444034024404143 |
6 | 115412144143234251 |
7 | 4503346406520001 |
oct | 506316070524567 |
9 | 87368263170884 |
10 | 22430213122423 |
11 | 716866660a287 |
12 | 2623160ba8987 |
13 | c6921074b672 |
14 | 5778b1755371 |
15 | 28d6dbe3349d |
hex | 146670e2a977 |
22430213122423 has 32 divisors (see below), whose sum is σ = 24383579351040. Its totient is φ = 20554468277760.
The previous prime is 22430213122411. The next prime is 22430213122439. The reversal of 22430213122423 is 32422131203422.
It is a de Polignac number, because none of the positive numbers 2k-22430213122423 is a prime.
It is a super-2 number, since 2×224302131224232 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22430213122463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 261323608 + ... + 261409426.
It is an arithmetic number, because the mean of its divisors is an integer number (761986854720).
Almost surely, 222430213122423 is an apocalyptic number.
22430213122423 is a deficient number, since it is larger than the sum of its proper divisors (1953366228617).
22430213122423 is a wasteful number, since it uses less digits than its factorization.
22430213122423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88447.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 22430213122423 its reverse (32422131203422), we get a palindrome (54852344325845).
The spelling of 22430213122423 in words is "twenty-two trillion, four hundred thirty billion, two hundred thirteen million, one hundred twenty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •