Base | Representation |
---|---|
bin | 10011000001010000… |
… | …11111001111101001 |
3 | 222100122002201122120 |
4 | 21200220133033221 |
5 | 131403024123230 |
6 | 4405124341453 |
7 | 511020302610 |
oct | 114050371751 |
9 | 28318081576 |
10 | 10211161065 |
11 | 436aa30496 |
12 | 1b8b844889 |
13 | c69681951 |
14 | 6cc20c877 |
15 | 3eb6be310 |
hex | 260a1f3e9 |
10211161065 has 16 divisors (see below), whose sum is σ = 18671837568. Its totient is φ = 4667959296.
The previous prime is 10211161049. The next prime is 10211161073. The reversal of 10211161065 is 56016111201.
10211161065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10211161065 - 24 = 10211161049 is a prime.
It is a super-3 number, since 3×102111610653 (a number of 31 digits) contains 333 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48624472 + ... + 48624681.
It is an arithmetic number, because the mean of its divisors is an integer number (1166989848).
Almost surely, 210211161065 is an apocalyptic number.
10211161065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10211161065 is a deficient number, since it is larger than the sum of its proper divisors (8460676503).
10211161065 is an equidigital number, since it uses as much as digits as its factorization.
10211161065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97249168.
The product of its (nonzero) digits is 360, while the sum is 24.
Adding to 10211161065 its reverse (56016111201), we get a palindrome (66227272266).
The spelling of 10211161065 in words is "ten billion, two hundred eleven million, one hundred sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •