Base | Representation |
---|---|
bin | 10010110101100110011110… |
… | …01101110010100001000001 |
3 | 12102200002221121122210211200 |
4 | 21122303033031302201001 |
5 | 20412143120110213441 |
6 | 224033553202331413 |
7 | 11503536555501552 |
oct | 1132631715624101 |
9 | 172602847583750 |
10 | 41424141101121 |
11 | 122209747a99a9 |
12 | 4790339059b69 |
13 | 1a163837a224c |
14 | a32d20d70329 |
15 | 4bc80c4407b6 |
hex | 25accf372841 |
41424141101121 has 12 divisors (see below), whose sum is σ = 59898054093072. Its totient is φ = 27586932399576.
The previous prime is 41424141101099. The next prime is 41424141101153. The reversal of 41424141101121 is 12110114142414.
It is a happy number.
41424141101121 is a `hidden beast` number, since 4 + 1 + 4 + 241 + 411 + 0 + 1 + 1 + 2 + 1 = 666.
It is not a de Polignac number, because 41424141101121 - 238 = 41149263194177 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41424141171121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2430129991 + ... + 2430147036.
It is an arithmetic number, because the mean of its divisors is an integer number (4991504507756).
Almost surely, 241424141101121 is an apocalyptic number.
It is an amenable number.
41424141101121 is a deficient number, since it is larger than the sum of its proper divisors (18473912991951).
41424141101121 is a wasteful number, since it uses less digits than its factorization.
41424141101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4860277980 (or 4860277977 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 27.
Adding to 41424141101121 its reverse (12110114142414), we get a palindrome (53534255243535).
The spelling of 41424141101121 in words is "forty-one trillion, four hundred twenty-four billion, one hundred forty-one million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •