Base | Representation |
---|---|
bin | 10100101101001100… |
… | …100101011001101001 |
3 | 2010101110112000110000 |
4 | 110231030211121221 |
5 | 331013134010441 |
6 | 14114100413213 |
7 | 1414646214015 |
oct | 245514453151 |
9 | 63343460400 |
10 | 22233110121 |
11 | 947a013782 |
12 | 43859a7209 |
13 | 213422ca81 |
14 | 110cb01545 |
15 | 8a1d282b6 |
hex | 52d325669 |
22233110121 has 20 divisors (see below), whose sum is σ = 33221372800. Its totient is φ = 14818079736.
The previous prime is 22233110117. The next prime is 22233110147. The reversal of 22233110121 is 12101133222.
It is not a de Polignac number, because 22233110121 - 22 = 22233110117 is a prime.
It is a super-2 number, since 2×222331101212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22233110094 and 22233110103.
It is not an unprimeable number, because it can be changed into a prime (22233110621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 282420 + ... + 352458.
It is an arithmetic number, because the mean of its divisors is an integer number (1661068640).
Almost surely, 222233110121 is an apocalyptic number.
It is an amenable number.
22233110121 is a deficient number, since it is larger than the sum of its proper divisors (10988262679).
22233110121 is an equidigital number, since it uses as much as digits as its factorization.
22233110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73970 (or 73961 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 22233110121 its reverse (12101133222), we get a palindrome (34334243343).
The spelling of 22233110121 in words is "twenty-two billion, two hundred thirty-three million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •