Base | Representation |
---|---|
bin | 110010010101111101101101… |
… | …111010101000010101010001 |
3 | 1002000221202022021122121010121 |
4 | 302111331231322220111101 |
5 | 213010102132002142233 |
6 | 2102523044321430241 |
7 | 64431316260254035 |
oct | 6225755572502521 |
9 | 1060852267577117 |
10 | 221411703162193 |
11 | 646041a3275645 |
12 | 209bb0a349b381 |
13 | 967105997c90b |
14 | 3c965528ba1c5 |
15 | 1a8e65e71d92d |
hex | c95f6dea8551 |
221411703162193 has 4 divisors (see below), whose sum is σ = 221414687342260. Its totient is φ = 221408718982128.
The previous prime is 221411703162107. The next prime is 221411703162197. The reversal of 221411703162193 is 391261307114122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 60175749833809 + 161235953328384 = 7757303^2 + 12697872^2 .
It is a cyclic number.
It is not a de Polignac number, because 221411703162193 - 241 = 219212679906641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221411703162197) 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, 1491978738 + ... + 1492127131.
It is an arithmetic number, because the mean of its divisors is an integer number (55353671835565).
Almost surely, 2221411703162193 is an apocalyptic number.
It is an amenable number.
221411703162193 is a deficient number, since it is larger than the sum of its proper divisors (2984180067).
221411703162193 is an equidigital number, since it uses as much as digits as its factorization.
221411703162193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2984180066.
The product of its (nonzero) digits is 108864, while the sum is 43.
The spelling of 221411703162193 in words is "two hundred twenty-one trillion, four hundred eleven billion, seven hundred three million, one hundred sixty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •