Base | Representation |
---|---|
bin | 10100100110011101… |
… | …110111110000100101 |
3 | 2010002121001122121002 |
4 | 110212131313300211 |
5 | 330300232420003 |
6 | 14054544403045 |
7 | 1412105415443 |
oct | 244635676045 |
9 | 63077048532 |
10 | 22120201253 |
11 | 9421305667 |
12 | 4354016485 |
13 | 2116a196a7 |
14 | 10dbb0db93 |
15 | 896e73a88 |
hex | 526777c25 |
22120201253 has 4 divisors (see below), whose sum is σ = 23421389580. Its totient is φ = 20819012928.
The previous prime is 22120201231. The next prime is 22120201283. The reversal of 22120201253 is 35210202122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17439315364 + 4680885889 = 132058^2 + 68417^2 .
It is a cyclic number.
It is not a de Polignac number, because 22120201253 - 214 = 22120184869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22120201283) 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, 650594138 + ... + 650594171.
It is an arithmetic number, because the mean of its divisors is an integer number (5855347395).
Almost surely, 222120201253 is an apocalyptic number.
It is an amenable number.
22120201253 is a deficient number, since it is larger than the sum of its proper divisors (1301188327).
22120201253 is a wasteful number, since it uses less digits than its factorization.
22120201253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1301188326.
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 22120201253 its reverse (35210202122), we get a palindrome (57330403375).
The spelling of 22120201253 in words is "twenty-two billion, one hundred twenty million, two hundred one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •