Base | Representation |
---|---|
bin | 10011110011010010… |
… | …10100110010011101 |
3 | 1000102212202010211122 |
4 | 21321221110302131 |
5 | 133232441421111 |
6 | 4514515100325 |
7 | 524304254303 |
oct | 117151246235 |
9 | 30385663748 |
10 | 10630810781 |
11 | 45658a7538 |
12 | 20882a16a5 |
13 | 10055b30a6 |
14 | 72bc4a273 |
15 | 423464cdb |
hex | 279a54c9d |
10630810781 has 4 divisors (see below), whose sum is σ = 10646894364. Its totient is φ = 10614727200.
The previous prime is 10630810763. The next prime is 10630810823. The reversal of 10630810781 is 18701803601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 18701803601 = 13 ⋅1438600277.
It can be written as a sum of positive squares in 2 ways, for example, as 9004301881 + 1626508900 = 94891^2 + 40330^2 .
It is a cyclic number.
It is not a de Polignac number, because 10630810781 - 214 = 10630794397 is a prime.
It is a super-2 number, since 2×106308107812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10630810711) 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, 8040800 + ... + 8042121.
It is an arithmetic number, because the mean of its divisors is an integer number (2661723591).
Almost surely, 210630810781 is an apocalyptic number.
It is an amenable number.
10630810781 is a deficient number, since it is larger than the sum of its proper divisors (16083583).
10630810781 is an equidigital number, since it uses as much as digits as its factorization.
10630810781 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16083582.
The product of its (nonzero) digits is 8064, while the sum is 35.
The spelling of 10630810781 in words is "ten billion, six hundred thirty million, eight hundred ten thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •