Base | Representation |
---|---|
bin | 11000001101111000… |
… | …11100101000110001 |
3 | 1020120002110010011020 |
4 | 30012330130220301 |
5 | 203111330123441 |
6 | 5550041210053 |
7 | 640121112456 |
oct | 140674345061 |
9 | 36502403136 |
10 | 13001411121 |
11 | 5571a59676 |
12 | 262a190929 |
13 | 12c277709a |
14 | 8b4a1582d |
15 | 51162ee66 |
hex | 306f1ca31 |
13001411121 has 4 divisors (see below), whose sum is σ = 17335214832. Its totient is φ = 8667607412.
The previous prime is 13001411077. The next prime is 13001411131. The reversal of 13001411121 is 12111410031.
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 a cyclic number.
It is not a de Polignac number, because 13001411121 - 26 = 13001411057 is a prime.
It is a super-2 number, since 2×130014111212 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13001411121.
It is not an unprimeable number, because it can be changed into a prime (13001411131) 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, 2166901851 + ... + 2166901856.
It is an arithmetic number, because the mean of its divisors is an integer number (4333803708).
Almost surely, 213001411121 is an apocalyptic number.
It is an amenable number.
13001411121 is a deficient number, since it is larger than the sum of its proper divisors (4333803711).
13001411121 is an equidigital number, since it uses as much as digits as its factorization.
13001411121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4333803710.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 13001411121 its reverse (12111410031), we get a palindrome (25112821152).
The spelling of 13001411121 in words is "thirteen billion, one million, four hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •