Base | Representation |
---|---|
bin | 10100100010011101… |
… | …100001101110010011 |
3 | 2002220220121120201201 |
4 | 110202131201232103 |
5 | 330131032032011 |
6 | 14044144212031 |
7 | 1410331265566 |
oct | 244235415623 |
9 | 62826546651 |
10 | 22053002131 |
11 | 93973879a6 |
12 | 433560a017 |
13 | 2105b1b9b4 |
14 | 10d2c1a4dd |
15 | 8910eccc1 |
hex | 522761b93 |
22053002131 has 4 divisors (see below), whose sum is σ = 22103237200. Its totient is φ = 22002767064.
The previous prime is 22053002129. The next prime is 22053002159. The reversal of 22053002131 is 13120035022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22053002131 - 21 = 22053002129 is a prime.
It is a super-2 number, since 2×220530021312 (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 = 22053002099 and 22053002108.
It is not an unprimeable number, because it can be changed into a prime (22053002161) 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 3 ways as a sum of consecutive naturals, for example, 25116876 + ... + 25117753.
It is an arithmetic number, because the mean of its divisors is an integer number (5525809300).
Almost surely, 222053002131 is an apocalyptic number.
22053002131 is a deficient number, since it is larger than the sum of its proper divisors (50235069).
22053002131 is an equidigital number, since it uses as much as digits as its factorization.
22053002131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50235068.
The product of its (nonzero) digits is 360, while the sum is 19.
Adding to 22053002131 its reverse (13120035022), we get a palindrome (35173037153).
The spelling of 22053002131 in words is "twenty-two billion, fifty-three million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •