Base | Representation |
---|---|
bin | 10100101100100011… |
… | …000000100010000010 |
3 | 2010100201000021221100 |
4 | 110230203000202002 |
5 | 331002341224302 |
6 | 14113031035230 |
7 | 1414454451522 |
oct | 245443004202 |
9 | 63321007840 |
10 | 22222211202 |
11 | 947394a204 |
12 | 438220bb16 |
13 | 2131bb4cc9 |
14 | 110b4a5682 |
15 | 8a0dc3d1c |
hex | 52c8c0882 |
22222211202 has 12 divisors (see below), whose sum is σ = 48148124310. Its totient is φ = 7407403728.
The previous prime is 22222211189. The next prime is 22222211203. The reversal of 22222211202 is 20211222222.
It can be written as a sum of positive squares in only one way, i.e., 21708780921 + 513430281 = 147339^2 + 22659^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1234567289 = 22222211202 / (2 + 2 + 2 + 2 + 2 + 2 + 1 + 1 + 2 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (22222211203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 617283627 + ... + 617283662.
Almost surely, 222222211202 is an apocalyptic number.
22222211202 is an abundant number, since it is smaller than the sum of its proper divisors (25925913108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22222211202 is a wasteful number, since it uses less digits than its factorization.
22222211202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1234567297 (or 1234567294 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 22222211202 its reverse (20211222222), we get a palindrome (42433433424).
The spelling of 22222211202 in words is "twenty-two billion, two hundred twenty-two million, two hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •