Base | Representation |
---|---|
bin | 100110010011000000… |
… | …111110101010101101 |
3 | 10221010210211001201122 |
4 | 212103000332222231 |
5 | 1133204012304401 |
6 | 30520230150325 |
7 | 2654010354443 |
oct | 462300765255 |
9 | 127123731648 |
10 | 41121213101 |
11 | 16491942041 |
12 | 7b774b23a5 |
13 | 3b5444c877 |
14 | 1dc146cb93 |
15 | 110a15d21b |
hex | 99303eaad |
41121213101 has 2 divisors, whose sum is σ = 41121213102. Its totient is φ = 41121213100.
The previous prime is 41121213061. The next prime is 41121213127. The reversal of 41121213101 is 10131212114.
41121213101 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., 20629576900 + 20491636201 = 143630^2 + 143149^2 .
It is a cyclic number.
It is not a de Polignac number, because 41121213101 - 226 = 41054104237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41121213101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41121213151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20560606550 + 20560606551.
It is an arithmetic number, because the mean of its divisors is an integer number (20560606551).
Almost surely, 241121213101 is an apocalyptic number.
It is an amenable number.
41121213101 is a deficient number, since it is larger than the sum of its proper divisors (1).
41121213101 is an equidigital number, since it uses as much as digits as its factorization.
41121213101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 41121213101 its reverse (10131212114), we get a palindrome (51252425215).
The spelling of 41121213101 in words is "forty-one billion, one hundred twenty-one million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •