Base | Representation |
---|---|
bin | 10100100110100001… |
… | …110011111100111001 |
3 | 2010002200000010120121 |
4 | 110212201303330321 |
5 | 330301013443413 |
6 | 14055022453241 |
7 | 1412120250160 |
oct | 244641637471 |
9 | 63080003517 |
10 | 22121234233 |
11 | 942195076a |
12 | 4354434221 |
13 | 2116cbb917 |
14 | 10dbcdc3d7 |
15 | 8970c9b8d |
hex | 526873f39 |
22121234233 has 4 divisors (see below), whose sum is σ = 25281410560. Its totient is φ = 18961057908.
The previous prime is 22121234203. The next prime is 22121234257. The reversal of 22121234233 is 33243212122.
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 22121234233 - 213 = 22121226041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22121234198 and 22121234207.
It is not an unprimeable number, because it can be changed into a prime (22121234203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1580088153 + ... + 1580088166.
It is an arithmetic number, because the mean of its divisors is an integer number (6320352640).
Almost surely, 222121234233 is an apocalyptic number.
It is an amenable number.
22121234233 is a deficient number, since it is larger than the sum of its proper divisors (3160176327).
22121234233 is an equidigital number, since it uses as much as digits as its factorization.
22121234233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3160176326.
The product of its digits is 3456, while the sum is 25.
Adding to 22121234233 its reverse (33243212122), we get a palindrome (55364446355).
The spelling of 22121234233 in words is "twenty-two billion, one hundred twenty-one million, two hundred thirty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •