Base | Representation |
---|---|
bin | 11000100000111010… |
… | …01001000001111001 |
3 | 1020222012200212201021 |
4 | 30100131021001321 |
5 | 203423202222010 |
6 | 10013541222441 |
7 | 644066311615 |
oct | 142035110171 |
9 | 36865625637 |
10 | 13160976505 |
11 | 5644034496 |
12 | 2673701a21 |
13 | 1319844a81 |
14 | 8cbcb0345 |
15 | 52064d8da |
hex | 310749079 |
13160976505 has 4 divisors (see below), whose sum is σ = 15793171812. Its totient is φ = 10528781200.
The previous prime is 13160976497. The next prime is 13160976509. The reversal of 13160976505 is 50567906131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50567906131 = 43 ⋅1175997817.
It can be written as a sum of positive squares in 2 ways, for example, as 7689711481 + 5471265024 = 87691^2 + 73968^2 .
It is not a de Polignac number, because 13160976505 - 23 = 13160976497 is a prime.
It is a super-2 number, since 2×131609765052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13160976509) 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, 1316097646 + ... + 1316097655.
It is an arithmetic number, because the mean of its divisors is an integer number (3948292953).
Almost surely, 213160976505 is an apocalyptic number.
It is an amenable number.
13160976505 is a deficient number, since it is larger than the sum of its proper divisors (2632195307).
13160976505 is an equidigital number, since it uses as much as digits as its factorization.
13160976505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2632195306.
The product of its (nonzero) digits is 170100, while the sum is 43.
The spelling of 13160976505 in words is "thirteen billion, one hundred sixty million, nine hundred seventy-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •