Base | Representation |
---|---|
bin | 100000001101111… |
… | …1101001100101001 |
3 | 2210100020001202121 |
4 | 1000123331030221 |
5 | 4203223223002 |
6 | 255135031241 |
7 | 35534642452 |
oct | 10033751451 |
9 | 2710201677 |
10 | 1081070377 |
11 | 5052661a2 |
12 | 26206b521 |
13 | 142c8381a |
14 | a3812129 |
15 | 64d97237 |
hex | 406fd329 |
1081070377 has 4 divisors (see below), whose sum is σ = 1081176660. Its totient is φ = 1080964096.
The previous prime is 1081070369. The next prime is 1081070401. The reversal of 1081070377 is 7730701801.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 7730701801 = 15233 ⋅507497.
It can be written as a sum of positive squares in 2 ways, for example, as 997549056 + 83521321 = 31584^2 + 9139^2 .
It is a cyclic number.
It is not a de Polignac number, because 1081070377 - 23 = 1081070369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1081070317) 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, 36052 + ... + 58837.
It is an arithmetic number, because the mean of its divisors is an integer number (270294165).
Almost surely, 21081070377 is an apocalyptic number.
It is an amenable number.
1081070377 is a deficient number, since it is larger than the sum of its proper divisors (106283).
1081070377 is an equidigital number, since it uses as much as digits as its factorization.
1081070377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106282.
The product of its (nonzero) digits is 8232, while the sum is 34.
The square root of 1081070377 is about 32879.6346847102. The cubic root of 1081070377 is about 1026.3244040405.
The spelling of 1081070377 in words is "one billion, eighty-one million, seventy thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •