Base | Representation |
---|---|
bin | 101001000010110… |
… | …0111101000000101 |
3 | 10112222110020202000 |
4 | 1102011213220011 |
5 | 10310031022431 |
6 | 344354135513 |
7 | 46062022113 |
oct | 12205475005 |
9 | 3488406660 |
10 | 1377204741 |
11 | 64743a340 |
12 | 325281599 |
13 | 18c429c63 |
14 | d0c9aab3 |
15 | 80d909e6 |
hex | 52167a05 |
1377204741 has 32 divisors (see below), whose sum is σ = 2322570240. Its totient is φ = 798375600.
The previous prime is 1377204707. The next prime is 1377204743. The reversal of 1377204741 is 1474027731.
It is not a de Polignac number, because 1377204741 - 26 = 1377204677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1377204696 and 1377204705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1377204743) 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 31 ways as a sum of consecutive naturals, for example, 93975 + ... + 107636.
It is an arithmetic number, because the mean of its divisors is an integer number (72580320).
Almost surely, 21377204741 is an apocalyptic number.
1377204741 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1377204741 is a deficient number, since it is larger than the sum of its proper divisors (945365499).
1377204741 is a wasteful number, since it uses less digits than its factorization.
1377204741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201654 (or 201648 counting only the distinct ones).
The product of its (nonzero) digits is 32928, while the sum is 36.
The square root of 1377204741 is about 37110.7092494875. The cubic root of 1377204741 is about 1112.5840673079.
The spelling of 1377204741 in words is "one billion, three hundred seventy-seven million, two hundred four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •