Base | Representation |
---|---|
bin | 10100111001001000… |
… | …010101000010100001 |
3 | 2010220102020210022020 |
4 | 110321020111002201 |
5 | 331420412233441 |
6 | 14150011532053 |
7 | 1422630040401 |
oct | 247110250241 |
9 | 63812223266 |
10 | 22433321121 |
11 | 9572030212 |
12 | 4420a5a029 |
13 | 216685c113 |
14 | 112b53a801 |
15 | 8b46c4e66 |
hex | 5392150a1 |
22433321121 has 4 divisors (see below), whose sum is σ = 29911094832. Its totient is φ = 14955547412.
The previous prime is 22433321087. The next prime is 22433321153. The reversal of 22433321121 is 12112333422.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22433321121 - 229 = 21896450209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22433321091 and 22433321100.
It is not an unprimeable number, because it can be changed into a prime (22433321161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3738886851 + ... + 3738886856.
It is an arithmetic number, because the mean of its divisors is an integer number (7477773708).
Almost surely, 222433321121 is an apocalyptic number.
It is an amenable number.
22433321121 is a deficient number, since it is larger than the sum of its proper divisors (7477773711).
22433321121 is an equidigital number, since it uses as much as digits as its factorization.
22433321121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7477773710.
The product of its digits is 1728, while the sum is 24.
Adding to 22433321121 its reverse (12112333422), we get a palindrome (34545654543).
The spelling of 22433321121 in words is "twenty-two billion, four hundred thirty-three million, three hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •