Base | Representation |
---|---|
bin | 1010001100101010001101… |
… | …10011101111111111010011 |
3 | 2221101211101121010101021002 |
4 | 11012111012303233333103 |
5 | 10414403313312122233 |
6 | 115410000020452215 |
7 | 4503111443546411 |
oct | 506250663577723 |
9 | 87354347111232 |
10 | 22425212223443 |
11 | 716652a748917 |
12 | 26221a624a06b |
13 | c688c4666843 |
14 | 5775594dc2b1 |
15 | 28d4e7da06e8 |
hex | 146546ceffd3 |
22425212223443 has 8 divisors (see below), whose sum is σ = 22680154008000. Its totient is φ = 22171110445800.
The previous prime is 22425212223437. The next prime is 22425212223467. The reversal of 22425212223443 is 34432221252422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22425212223443 - 210 = 22425212222419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22425212223397 and 22425212223406.
It is not an unprimeable number, because it can be changed into a prime (22425212225443) 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, 209948033 + ... + 210054818.
It is an arithmetic number, because the mean of its divisors is an integer number (2835019251000).
Almost surely, 222425212223443 is an apocalyptic number.
22425212223443 is a deficient number, since it is larger than the sum of its proper divisors (254941784557).
22425212223443 is a wasteful number, since it uses less digits than its factorization.
22425212223443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420003457.
The product of its digits is 368640, while the sum is 38.
Adding to 22425212223443 its reverse (34432221252422), we get a palindrome (56857433475865).
The spelling of 22425212223443 in words is "twenty-two trillion, four hundred twenty-five billion, two hundred twelve million, two hundred twenty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •