Base | Representation |
---|---|
bin | 101001000010001… |
… | …1001100110101001 |
3 | 10112221212000100201 |
4 | 1102010121212221 |
5 | 10304440311121 |
6 | 344343232201 |
7 | 46056221311 |
oct | 12204314651 |
9 | 3487760321 |
10 | 1376885161 |
11 | 647241223 |
12 | 325148661 |
13 | 18c347662 |
14 | d0c16441 |
15 | 80d2ae91 |
hex | 521199a9 |
1376885161 has 4 divisors (see below), whose sum is σ = 1377125712. Its totient is φ = 1376644612.
The previous prime is 1376885149. The next prime is 1376885177. The reversal of 1376885161 is 1615886731.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1615886731 = 181 ⋅8927551.
It is a cyclic number.
It is not a de Polignac number, because 1376885161 - 211 = 1376883113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1376885261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111475 + ... + 123208.
It is an arithmetic number, because the mean of its divisors is an integer number (344281428).
Almost surely, 21376885161 is an apocalyptic number.
It is an amenable number.
1376885161 is a deficient number, since it is larger than the sum of its proper divisors (240551).
1376885161 is an equidigital number, since it uses as much as digits as its factorization.
1376885161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240550.
The product of its digits is 241920, while the sum is 46.
The square root of 1376885161 is about 37106.4032344823. The cubic root of 1376885161 is about 1112.4980023699.
The spelling of 1376885161 in words is "one billion, three hundred seventy-six million, eight hundred eighty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •