Base | Representation |
---|---|
bin | 110110110110001111110100… |
… | …100111011111111001010101 |
3 | 1011122002122001110221122001222 |
4 | 312312033310213133321111 |
5 | 223104141334133141323 |
6 | 2213012004020300125 |
7 | 101544511522110431 |
oct | 6666176447377125 |
9 | 1148078043848058 |
10 | 241222352240213 |
11 | 6a951909205403 |
12 | 2307a611841645 |
13 | a47a229c52086 |
14 | 437d31d0999c1 |
15 | 1cd4b30ea29c8 |
hex | db63f49dfe55 |
241222352240213 has 8 divisors (see below), whose sum is σ = 244031594250240. Its totient is φ = 238415307530400.
The previous prime is 241222352240173. The next prime is 241222352240329. The reversal of 241222352240213 is 312042253222142.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 241222352240213 - 216 = 241222352174677 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 (241222352240113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 549104213 + ... + 549543338.
It is an arithmetic number, because the mean of its divisors is an integer number (30503949281280).
Almost surely, 2241222352240213 is an apocalyptic number.
It is an amenable number.
241222352240213 is a deficient number, since it is larger than the sum of its proper divisors (2809242010027).
241222352240213 is a wasteful number, since it uses less digits than its factorization.
241222352240213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1098650107.
The product of its (nonzero) digits is 92160, while the sum is 35.
The spelling of 241222352240213 in words is "two hundred forty-one trillion, two hundred twenty-two billion, three hundred fifty-two million, two hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •