Base | Representation |
---|---|
bin | 1010010010110011001111… |
… | …11000000100000110010111 |
3 | 2222011000001010020101011012 |
4 | 11021121213320010012113 |
5 | 10431332434410300043 |
6 | 120050534110202435 |
7 | 4524261433502606 |
oct | 511314770040627 |
9 | 88130033211135 |
10 | 22636220400023 |
11 | 7237a7032200a |
12 | 26570744b341b |
13 | c827814b3c69 |
14 | 5838555bba3d |
15 | 293c4797ba18 |
hex | 149667e04197 |
22636220400023 has 4 divisors (see below), whose sum is σ = 22636237069248. Its totient is φ = 22636203730800.
The previous prime is 22636220399999. The next prime is 22636220400029. The reversal of 22636220400023 is 32000402263622.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22636220400023 - 226 = 22636153291159 is a prime.
It is a super-2 number, since 2×226362204000232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22636220400029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6097511 + ... + 9080312.
It is an arithmetic number, because the mean of its divisors is an integer number (5659059267312).
Almost surely, 222636220400023 is an apocalyptic number.
22636220400023 is a deficient number, since it is larger than the sum of its proper divisors (16669225).
22636220400023 is a wasteful number, since it uses less digits than its factorization.
22636220400023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16669224.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 22636220400023 its reverse (32000402263622), we get a palindrome (54636622663645).
The spelling of 22636220400023 in words is "twenty-two trillion, six hundred thirty-six billion, two hundred twenty million, four hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •