Base | Representation |
---|---|
bin | 10010111000001100100100… |
… | …01011011111100110100001 |
3 | 12102222122010001022110021210 |
4 | 21130012102023133212201 |
5 | 20420123230204334101 |
6 | 224142541343340333 |
7 | 11513144361526446 |
oct | 1134062213374641 |
9 | 172878101273253 |
10 | 41513311402401 |
11 | 12255773045073 |
12 | 47a5683bb16a9 |
13 | 1a218c4743827 |
14 | a3737d9b19cd |
15 | 4beccaa2a7d6 |
hex | 25c1922df9a1 |
41513311402401 has 4 divisors (see below), whose sum is σ = 55351081869872. Its totient is φ = 27675540934932.
The previous prime is 41513311402397. The next prime is 41513311402427. The reversal of 41513311402401 is 10420411331514.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 41513311402401 - 22 = 41513311402397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41513311404401) 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, 6918885233731 + ... + 6918885233736.
It is an arithmetic number, because the mean of its divisors is an integer number (13837770467468).
Almost surely, 241513311402401 is an apocalyptic number.
It is an amenable number.
41513311402401 is a deficient number, since it is larger than the sum of its proper divisors (13837770467471).
41513311402401 is a wasteful number, since it uses less digits than its factorization.
41513311402401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13837770467470.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 41513311402401 its reverse (10420411331514), we get a palindrome (51933722733915).
The spelling of 41513311402401 in words is "forty-one trillion, five hundred thirteen billion, three hundred eleven million, four hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •