Base | Representation |
---|---|
bin | 10100000110011101… |
… | …11110111011111001 |
3 | 1000212002110000202021 |
4 | 22003032332323321 |
5 | 134100132141224 |
6 | 4542503034441 |
7 | 531266514112 |
oct | 120316767371 |
9 | 30762400667 |
10 | 10791677689 |
11 | 46386911a1 |
12 | 211213ba21 |
13 | 102ca18300 |
14 | 745363209 |
15 | 43263e1e4 |
hex | 2833beef9 |
10791677689 has 27 divisors (see below), whose sum is σ = 11971753677. Its totient is φ = 9723448800.
The previous prime is 10791677647. The next prime is 10791677713. The reversal of 10791677689 is 98677619701.
The square root of 10791677689 is 103883.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 7589023225 + 3202654464 = 87115^2 + 56592^2 .
It is not a de Polignac number, because 10791677689 - 215 = 10791644921 is a prime.
It is a super-3 number, since 3×107916776893 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (61).
It is not an unprimeable number, because it can be changed into a prime (10791677789) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 82379154 + ... + 82379284.
Almost surely, 210791677689 is an apocalyptic number.
10791677689 is the 103883-rd square number.
10791677689 is the 51942-nd centered octagonal number.
It is an amenable number.
10791677689 is a deficient number, since it is larger than the sum of its proper divisors (1180075988).
10791677689 is an frugal number, since it uses more digits than its factorization.
10791677689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410 (or 205 counting only the distinct ones).
The product of its (nonzero) digits is 8001504, while the sum is 61.
The spelling of 10791677689 in words is "ten billion, seven hundred ninety-one million, six hundred seventy-seven thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •