Base | Representation |
---|---|
bin | 100110010011100010… |
… | …111000111010000001 |
3 | 10221011102112200112222 |
4 | 212103202320322001 |
5 | 1133213301234101 |
6 | 30521144500425 |
7 | 2654146046663 |
oct | 462342707201 |
9 | 127142480488 |
10 | 41130102401 |
11 | 16496963773 |
12 | 7b7a47a715 |
13 | 3b562429cb |
14 | 1dc2704533 |
15 | 110ad1701b |
hex | 9938b8e81 |
41130102401 has 4 divisors (see below), whose sum is σ = 41507442900. Its totient is φ = 40752761904.
The previous prime is 41130102359. The next prime is 41130102451. The reversal of 41130102401 is 10420103114.
It is a happy number.
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 35620900225 + 5509202176 = 188735^2 + 74224^2 .
It is a cyclic number.
It is not a de Polignac number, because 41130102401 - 222 = 41125908097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41130102401.
It is not an unprimeable number, because it can be changed into a prime (41130102451) 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, 188670086 + ... + 188670303.
It is an arithmetic number, because the mean of its divisors is an integer number (10376860725).
Almost surely, 241130102401 is an apocalyptic number.
It is an amenable number.
41130102401 is a deficient number, since it is larger than the sum of its proper divisors (377340499).
41130102401 is a wasteful number, since it uses less digits than its factorization.
41130102401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 377340498.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 41130102401 its reverse (10420103114), we get a palindrome (51550205515).
The spelling of 41130102401 in words is "forty-one billion, one hundred thirty million, one hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •