Base | Representation |
---|---|
bin | 10100011011000000… |
… | …01111101000011001 |
3 | 1001022002122121210100 |
4 | 22031200033220121 |
5 | 134423234142211 |
6 | 5011540010013 |
7 | 535461150522 |
oct | 121540175031 |
9 | 31262577710 |
10 | 10963974681 |
11 | 4716972500 |
12 | 215b990909 |
13 | 1059622caa |
14 | 7601b3849 |
15 | 442825156 |
hex | 28d80fa19 |
10963974681 has 81 divisors (see below), whose sum is σ = 18482520693. Its totient is φ = 6257409840.
The previous prime is 10963974667. The next prime is 10963974683. The reversal of 10963974681 is 18647936901.
The square root of 10963974681 is 104709.
It is a perfect power (a square), and thus also a powerful number.
10963974681 is a `hidden beast` number, since 1 + 0 + 96 + 3 + 97 + 468 + 1 = 666.
It is not a de Polignac number, because 10963974681 - 227 = 10829756953 is a prime.
It is a super-2 number, since 2×109639746812 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10963974683) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 65652460 + ... + 65652626.
Almost surely, 210963974681 is an apocalyptic number.
10963974681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10963974681 is the 104709-th square number.
10963974681 is the 52355-th centered octagonal number.
It is an amenable number.
10963974681 is a deficient number, since it is larger than the sum of its proper divisors (7518546012).
10963974681 is a wasteful number, since it uses less digits than its factorization.
10963974681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400 (or 200 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 54.
The spelling of 10963974681 in words is "ten billion, nine hundred sixty-three million, nine hundred seventy-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •