Base | Representation |
---|---|
bin | 10100100111000100… |
… | …000011110101101001 |
3 | 2010010021220021000221 |
4 | 110213010003311221 |
5 | 330310313242301 |
6 | 14055543130041 |
7 | 1412256462046 |
oct | 244704036551 |
9 | 63107807027 |
10 | 22130212201 |
11 | 9426a22a79 |
12 | 4357443921 |
13 | 2118b13226 |
14 | 10dd1981cd |
15 | 897c9eda1 |
hex | 527103d69 |
22130212201 has 4 divisors (see below), whose sum is σ = 22156908100. Its totient is φ = 22103516304.
The previous prime is 22130212177. The next prime is 22130212207. The reversal of 22130212201 is 10221203122.
It is a happy number.
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 15957752976 + 6172459225 = 126324^2 + 78565^2 .
It is a cyclic number.
It is not a de Polignac number, because 22130212201 - 211 = 22130210153 is a prime.
It is a super-2 number, since 2×221302122012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22130212207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13346706 + ... + 13348363.
It is an arithmetic number, because the mean of its divisors is an integer number (5539227025).
Almost surely, 222130212201 is an apocalyptic number.
It is an amenable number.
22130212201 is a deficient number, since it is larger than the sum of its proper divisors (26695899).
22130212201 is an equidigital number, since it uses as much as digits as its factorization.
22130212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26695898.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 22130212201 its reverse (10221203122), we get a palindrome (32351415323).
The spelling of 22130212201 in words is "twenty-two billion, one hundred thirty million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •