Base | Representation |
---|---|
bin | 1010000110101100010111… |
… | …01110010111011111110101 |
3 | 2220200020020122021221001212 |
4 | 11003112023232113133311 |
5 | 10403023442230310401 |
6 | 115131453515531205 |
7 | 4452233342516135 |
oct | 503261356273765 |
9 | 86606218257055 |
10 | 22220210010101 |
11 | 70975a12a8804 |
12 | 25aa513459b05 |
13 | c52483bc251c |
14 | 56b66cd40ac5 |
15 | 287eea6d8dbb |
hex | 14358bb977f5 |
22220210010101 has 4 divisors (see below), whose sum is σ = 22220959128192. Its totient is φ = 22219460892012.
The previous prime is 22220210010083. The next prime is 22220210010107. The reversal of 22220210010101 is 10101001202222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22220210010101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22220210010107) 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, 374514551 + ... + 374573876.
It is an arithmetic number, because the mean of its divisors is an integer number (5555239782048).
Almost surely, 222220210010101 is an apocalyptic number.
It is an amenable number.
22220210010101 is a deficient number, since it is larger than the sum of its proper divisors (749118091).
22220210010101 is an equidigital number, since it uses as much as digits as its factorization.
22220210010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 749118090.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22220210010101 its reverse (10101001202222), we get a palindrome (32321211212323).
The spelling of 22220210010101 in words is "twenty-two trillion, two hundred twenty billion, two hundred ten million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •