Base | Representation |
---|---|
bin | 1001010010011000000100… |
… | …0001110100010111100111 |
3 | 1100011012011012020000211012 |
4 | 2110212001001310113213 |
5 | 2314300221303000403 |
6 | 33415001332132435 |
7 | 2102512403614031 |
oct | 224460101642747 |
9 | 40135135200735 |
10 | 10211302000103 |
11 | 3287652853176 |
12 | 118b02846711b |
13 | 590bc9b20309 |
14 | 274330254c51 |
15 | 12a94570ced8 |
hex | 949810745e7 |
10211302000103 has 8 divisors (see below), whose sum is σ = 10667695213056. Its totient is φ = 9762846060600.
The previous prime is 10211302000073. The next prime is 10211302000181. The reversal of 10211302000103 is 30100020311201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10211302000103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211352000103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1984315733 + ... + 1984320878.
It is an arithmetic number, because the mean of its divisors is an integer number (1333461901632).
Almost surely, 210211302000103 is an apocalyptic number.
10211302000103 is a deficient number, since it is larger than the sum of its proper divisors (456393212953).
10211302000103 is an equidigital number, since it uses as much as digits as its factorization.
10211302000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3968636725.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10211302000103 its reverse (30100020311201), we get a palindrome (40311322311304).
The spelling of 10211302000103 in words is "ten trillion, two hundred eleven billion, three hundred two million, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •