Base | Representation |
---|---|
bin | 111100010000110011011… |
… | …010101010001101001101 |
3 | 112122220012010021211112012 |
4 | 330100303122222031031 |
5 | 1020322200020144411 |
6 | 12450240205551005 |
7 | 605123033361134 |
oct | 74206332521515 |
9 | 15586163254465 |
10 | 4141211099981 |
11 | 135730678308a |
12 | 56a717275465 |
13 | 24068c56a327 |
14 | 10461574a91b |
15 | 72ac81ab18b |
hex | 3c4336aa34d |
4141211099981 has 2 divisors, whose sum is σ = 4141211099982. Its totient is φ = 4141211099980.
The previous prime is 4141211099911. The next prime is 4141211100041. The reversal of 4141211099981 is 1899901121414.
4141211099981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4137701129956 + 3509970025 = 2034134^2 + 59245^2 .
It is a cyclic number.
It is not a de Polignac number, because 4141211099981 - 218 = 4141210837837 is a prime.
It is a super-2 number, since 2×41412110999812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4141211099911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2070605549990 + 2070605549991.
It is an arithmetic number, because the mean of its divisors is an integer number (2070605549991).
Almost surely, 24141211099981 is an apocalyptic number.
It is an amenable number.
4141211099981 is a deficient number, since it is larger than the sum of its proper divisors (1).
4141211099981 is an equidigital number, since it uses as much as digits as its factorization.
4141211099981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 50.
The spelling of 4141211099981 in words is "four trillion, one hundred forty-one billion, two hundred eleven million, ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •