Base | Representation |
---|---|
bin | 1010000110101100011001… |
… | …00000110110001111101001 |
3 | 2220200020021120012020112011 |
4 | 11003112030200312033221 |
5 | 10403024004122240431 |
6 | 115131455111315521 |
7 | 4452233563142542 |
oct | 503261440661751 |
9 | 86606246166464 |
10 | 22220223243241 |
11 | 70975a8816a91 |
12 | 25aa51797bba1 |
13 | c5248687689a |
14 | 56b6709c74c9 |
15 | 287eeb94ecb1 |
hex | 14358c8363e9 |
22220223243241 has 4 divisors (see below), whose sum is σ = 22692993950592. Its totient is φ = 21747452535892.
The previous prime is 22220223243193. The next prime is 22220223243259. The reversal of 22220223243241 is 14234232202222.
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 22220223243241 - 29 = 22220223242729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22220223246241) 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, 236385353605 + ... + 236385353698.
It is an arithmetic number, because the mean of its divisors is an integer number (5673248487648).
Almost surely, 222220223243241 is an apocalyptic number.
It is an amenable number.
22220223243241 is a deficient number, since it is larger than the sum of its proper divisors (472770707351).
22220223243241 is an equidigital number, since it uses as much as digits as its factorization.
22220223243241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472770707350.
The product of its (nonzero) digits is 36864, while the sum is 31.
Adding to 22220223243241 its reverse (14234232202222), we get a palindrome (36454455445463).
The spelling of 22220223243241 in words is "twenty-two trillion, two hundred twenty billion, two hundred twenty-three million, two hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •