Base | Representation |
---|---|
bin | 1010000110011011010001… |
… | …10000000011001011011101 |
3 | 2220122100120002201110120222 |
4 | 11003031220300003023131 |
5 | 10402401144012022023 |
6 | 115123335143251125 |
7 | 4451460053060135 |
oct | 503155060031335 |
9 | 86570502643528 |
10 | 22211033314013 |
11 | 70937122a1155 |
12 | 25a8792149aa5 |
13 | c5165095713b |
14 | 56b03c291ac5 |
15 | 287b5ec57cc8 |
hex | 143368c032dd |
22211033314013 has 4 divisors (see below), whose sum is σ = 22211238815520. Its totient is φ = 22210827812508.
The previous prime is 22211033313991. The next prime is 22211033314061. The reversal of 22211033314013 is 31041333011222.
It is a happy number.
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 not a de Polignac number, because 22211033314013 - 28 = 22211033313757 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 (22211033314913) 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, 102588545 + ... + 102804822.
It is an arithmetic number, because the mean of its divisors is an integer number (5552809703880).
Almost surely, 222211033314013 is an apocalyptic number.
It is an amenable number.
22211033314013 is a deficient number, since it is larger than the sum of its proper divisors (205501507).
22211033314013 is a wasteful number, since it uses less digits than its factorization.
22211033314013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205501506.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 22211033314013 its reverse (31041333011222), we get a palindrome (53252366325235).
The spelling of 22211033314013 in words is "twenty-two trillion, two hundred eleven billion, thirty-three million, three hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •