Base | Representation |
---|---|
bin | 1010000110011111001000… |
… | …01100001111000010111101 |
3 | 2220122112220102122110120212 |
4 | 11003033210030033002331 |
5 | 10402414414200101341 |
6 | 115124320443522205 |
7 | 4451562301133612 |
oct | 503174414170275 |
9 | 86575812573525 |
10 | 22213104300221 |
11 | 70945853127aa |
12 | 25a906b829365 |
13 | c518c0a26b73 |
14 | 56b197348509 |
15 | 287c3198d5eb |
hex | 1433e430f0bd |
22213104300221 has 4 divisors (see below), whose sum is σ = 22310959385472. Its totient is φ = 22115249214972.
The previous prime is 22213104300197. The next prime is 22213104300269. The reversal of 22213104300221 is 12200340131222.
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 22213104300221 - 226 = 22213037191357 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 (22213104390221) 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, 48927542285 + ... + 48927542738.
It is an arithmetic number, because the mean of its divisors is an integer number (5577739846368).
Almost surely, 222213104300221 is an apocalyptic number.
It is an amenable number.
22213104300221 is a deficient number, since it is larger than the sum of its proper divisors (97855085251).
22213104300221 is an equidigital number, since it uses as much as digits as its factorization.
22213104300221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97855085250.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 22213104300221 its reverse (12200340131222), we get a palindrome (34413444431443).
The spelling of 22213104300221 in words is "twenty-two trillion, two hundred thirteen billion, one hundred four million, three hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •