Base | Representation |
---|---|
bin | 110010010101111101101000… |
… | …001100011001101000010111 |
3 | 1002000221202001121000001010202 |
4 | 302111331220030121220113 |
5 | 213010101432413013041 |
6 | 2102523031012011115 |
7 | 64431314013241226 |
oct | 6225755014315027 |
9 | 1060852047001122 |
10 | 221411607157271 |
11 | 64604154062733 |
12 | 209bb077300a9b |
13 | 9671042b0767b |
14 | 3c96543c48cbd |
15 | 1a8e6560a7a9b |
hex | c95f68319a17 |
221411607157271 has 2 divisors, whose sum is σ = 221411607157272. Its totient is φ = 221411607157270.
The previous prime is 221411607157211. The next prime is 221411607157339. The reversal of 221411607157271 is 172751706114122.
221411607157271 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221411607157271 is a prime.
It is a super-3 number, since 3×2214116071572713 (a number of 44 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221411607157211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110705803578635 + 110705803578636.
It is an arithmetic number, because the mean of its divisors is an integer number (110705803578636).
Almost surely, 2221411607157271 is an apocalyptic number.
221411607157271 is a deficient number, since it is larger than the sum of its proper divisors (1).
221411607157271 is an equidigital number, since it uses as much as digits as its factorization.
221411607157271 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 329280, while the sum is 47.
The spelling of 221411607157271 in words is "two hundred twenty-one trillion, four hundred eleven billion, six hundred seven million, one hundred fifty-seven thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •