Base | Representation |
---|---|
bin | 1010000110110010001001… |
… | …00100110111000101100101 |
3 | 2220200112020202220221011022 |
4 | 11003121010210313011211 |
5 | 10403101320143144023 |
6 | 115133125343220525 |
7 | 4452403241210342 |
oct | 503310444670545 |
9 | 86615222827138 |
10 | 22223311303013 |
11 | 7098942962aa7 |
12 | 25ab039ba7745 |
13 | c52859580ba2 |
14 | 56b884b937c9 |
15 | 28812cada7c8 |
hex | 143644937165 |
22223311303013 has 4 divisors (see below), whose sum is σ = 22431005801280. Its totient is φ = 22015616804748.
The previous prime is 22223311303001. The next prime is 22223311303043. The reversal of 22223311303013 is 31030311332222.
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 22223311303013 - 220 = 22223310254437 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 (22223311303043) 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, 103847248973 + ... + 103847249186.
It is an arithmetic number, because the mean of its divisors is an integer number (5607751450320).
Almost surely, 222223311303013 is an apocalyptic number.
It is an amenable number.
22223311303013 is a deficient number, since it is larger than the sum of its proper divisors (207694498267).
22223311303013 is a wasteful number, since it uses less digits than its factorization.
22223311303013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207694498266.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 22223311303013 its reverse (31030311332222), we get a palindrome (53253622635235).
The spelling of 22223311303013 in words is "twenty-two trillion, two hundred twenty-three billion, three hundred eleven million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.079 sec. • engine limits •