Base | Representation |
---|---|
bin | 101001001001011… |
… | …1000011000111101 |
3 | 10120012222212122121 |
4 | 1102102320120331 |
5 | 10311423300102 |
6 | 345000442541 |
7 | 46133411563 |
oct | 12222703075 |
9 | 3505885577 |
10 | 1380681277 |
11 | 6493a4308 |
12 | 326479451 |
13 | 190076491 |
14 | d1523a33 |
15 | 8132ab37 |
hex | 524b863d |
1380681277 has 4 divisors (see below), whose sum is σ = 1387835260. Its totient is φ = 1373527296.
The previous prime is 1380681221. The next prime is 1380681287. The reversal of 1380681277 is 7721860831.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7721860831 = 6949 ⋅1111219.
It can be written as a sum of positive squares in 2 ways, for example, as 648924676 + 731756601 = 25474^2 + 27051^2 .
It is a cyclic number.
It is not a de Polignac number, because 1380681277 - 27 = 1380681149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1380681287) 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, 3576702 + ... + 3577087.
It is an arithmetic number, because the mean of its divisors is an integer number (346958815).
Almost surely, 21380681277 is an apocalyptic number.
It is an amenable number.
1380681277 is a deficient number, since it is larger than the sum of its proper divisors (7153983).
1380681277 is an equidigital number, since it uses as much as digits as its factorization.
1380681277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7153982.
The product of its (nonzero) digits is 112896, while the sum is 43.
The square root of 1380681277 is about 37157.5197907503. The cubic root of 1380681277 is about 1113.5194616222.
The spelling of 1380681277 in words is "one billion, three hundred eighty million, six hundred eighty-one thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •