Base | Representation |
---|---|
bin | 1010001100101100110101… |
… | …11011111011010111010011 |
3 | 2221101222000221222110002010 |
4 | 11012112122323323113103 |
5 | 10414414211123401311 |
6 | 115410352040354003 |
7 | 4503161432525352 |
oct | 506263273732723 |
9 | 87358027873063 |
10 | 22426623653331 |
11 | 7167094433aa7 |
12 | 262251aa75903 |
13 | c68a8abb7961 |
14 | 577650b47999 |
15 | 28d57bc51da6 |
hex | 14659aefb5d3 |
22426623653331 has 8 divisors (see below), whose sum is σ = 29902391846800. Its totient is φ = 14950968947712.
The previous prime is 22426623653303. The next prime is 22426623653351. The reversal of 22426623653331 is 13335632662422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22426623653331 - 226 = 22426556544467 is a prime.
It is a super-2 number, since 2×224266236533312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22426623653351) 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, 27909790 + ... + 28702083.
It is an arithmetic number, because the mean of its divisors is an integer number (3737798980850).
Almost surely, 222426623653331 is an apocalyptic number.
22426623653331 is a deficient number, since it is larger than the sum of its proper divisors (7475768193469).
22426623653331 is a wasteful number, since it uses less digits than its factorization.
22426623653331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56743925.
The product of its digits is 5598720, while the sum is 48.
Subtracting from 22426623653331 its reverse (13335632662422), we obtain a palindrome (9090990990909).
The spelling of 22426623653331 in words is "twenty-two trillion, four hundred twenty-six billion, six hundred twenty-three million, six hundred fifty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.587 sec. • engine limits •