Base | Representation |
---|---|
bin | 11001111001111001… |
… | …11100111101001001 |
3 | 1022220020102212111001 |
4 | 30330330330331021 |
5 | 211440310410121 |
6 | 10220010135001 |
7 | 1001432624413 |
oct | 147474747511 |
9 | 38806385431 |
10 | 13907513161 |
11 | 5997479533 |
12 | 2841721461 |
13 | 14083c9039 |
14 | 95d0bd9b3 |
15 | 565e64991 |
hex | 33cf3cf49 |
13907513161 has 4 divisors (see below), whose sum is σ = 13912383892. Its totient is φ = 13902642432.
The previous prime is 13907513149. The next prime is 13907513171. The reversal of 13907513161 is 16131570931.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5451607225 + 8455905936 = 73835^2 + 91956^2 .
It is a cyclic number.
It is not a de Polignac number, because 13907513161 - 215 = 13907480393 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13907513161.
It is not an unprimeable number, because it can be changed into a prime (13907513111) 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, 2431080 + ... + 2436793.
It is an arithmetic number, because the mean of its divisors is an integer number (3478095973).
Almost surely, 213907513161 is an apocalyptic number.
It is an amenable number.
13907513161 is a deficient number, since it is larger than the sum of its proper divisors (4870731).
13907513161 is an equidigital number, since it uses as much as digits as its factorization.
13907513161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4870730.
The product of its (nonzero) digits is 17010, while the sum is 37.
The spelling of 13907513161 in words is "thirteen billion, nine hundred seven million, five hundred thirteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •