Base | Representation |
---|---|
bin | 101000010110110… |
… | …111000000111001 |
3 | 1202012001021201110 |
4 | 220112313000321 |
5 | 2341313044040 |
6 | 151104110533 |
7 | 22531044336 |
oct | 5026670071 |
9 | 1665037643 |
10 | 677081145 |
11 | 3182160a4 |
12 | 16a905449 |
13 | aa376540 |
14 | 65ccd98d |
15 | 3e696980 |
hex | 285b7039 |
677081145 has 16 divisors (see below), whose sum is σ = 1166663232. Its totient is φ = 333332160.
The previous prime is 677081143. The next prime is 677081147. The reversal of 677081145 is 541180776.
It is an interprime number because it is at equal distance from previous prime (677081143) and next prime (677081147).
It is not a de Polignac number, because 677081145 - 21 = 677081143 is a prime.
It is a super-2 number, since 2×6770811452 = 916877753829022050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (677081143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1735911 + ... + 1736300.
It is an arithmetic number, because the mean of its divisors is an integer number (72916452).
Almost surely, 2677081145 is an apocalyptic number.
677081145 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
677081145 is a deficient number, since it is larger than the sum of its proper divisors (489582087).
677081145 is a wasteful number, since it uses less digits than its factorization.
677081145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3472232.
The product of its (nonzero) digits is 47040, while the sum is 39.
The square root of 677081145 is about 26020.7829436395. The cubic root of 677081145 is about 878.1059231765.
The spelling of 677081145 in words is "six hundred seventy-seven million, eighty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •