Base | Representation |
---|---|
bin | 11000010111010100… |
… | …11001110101100101 |
3 | 1020202121101122210200 |
4 | 30023222121311211 |
5 | 203242111122031 |
6 | 10001545541113 |
7 | 642101662155 |
oct | 141352316545 |
9 | 36677348720 |
10 | 13080567141 |
11 | 5602703774 |
12 | 26507a4799 |
13 | 1305ca0275 |
14 | 8c133c765 |
15 | 5185688e6 |
hex | 30ba99d65 |
13080567141 has 24 divisors (see below), whose sum is σ = 18993326040. Its totient is φ = 8674713600.
The previous prime is 13080567139. The next prime is 13080567151. The reversal of 13080567141 is 14176508031.
13080567141 is a `hidden beast` number, since 1 + 3 + 0 + 80 + 567 + 14 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 1516790916 + 11563776225 = 38946^2 + 107535^2 .
It is not a de Polignac number, because 13080567141 - 21 = 13080567139 is a prime.
It is a super-2 number, since 2×130805671412 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13080567096 and 13080567105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13080567151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1617055 + ... + 1625123.
It is an arithmetic number, because the mean of its divisors is an integer number (791388585).
Almost surely, 213080567141 is an apocalyptic number.
It is an amenable number.
13080567141 is a deficient number, since it is larger than the sum of its proper divisors (5912758899).
13080567141 is a wasteful number, since it uses less digits than its factorization.
13080567141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8997 (or 8994 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The spelling of 13080567141 in words is "thirteen billion, eighty million, five hundred sixty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •