Base | Representation |
---|---|
bin | 11000001101111000… |
… | …10001100011101101 |
3 | 1020120002100210220111 |
4 | 30012330101203231 |
5 | 203111322200431 |
6 | 5550040220021 |
7 | 640120533250 |
oct | 140674214355 |
9 | 36502323814 |
10 | 13001365741 |
11 | 5571a28571 |
12 | 262a16a611 |
13 | 12c275c530 |
14 | 8b4a03097 |
15 | 5116217b1 |
hex | 306f118ed |
13001365741 has 16 divisors (see below), whose sum is σ = 16342147584. Its totient is φ = 10067923584.
The previous prime is 13001365709. The next prime is 13001365747. The reversal of 13001365741 is 14756310031.
13001365741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13001365741 - 25 = 13001365709 is a prime.
It is a super-2 number, since 2×130013657412 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13001365747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1515640 + ... + 1524193.
It is an arithmetic number, because the mean of its divisors is an integer number (1021384224).
Almost surely, 213001365741 is an apocalyptic number.
It is an amenable number.
13001365741 is a deficient number, since it is larger than the sum of its proper divisors (3340781843).
13001365741 is a wasteful number, since it uses less digits than its factorization.
13001365741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3039900.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 13001365741 its reverse (14756310031), we get a palindrome (27757675772).
The spelling of 13001365741 in words is "thirteen billion, one million, three hundred sixty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •