Base | Representation |
---|---|
bin | 1001001101110010001011… |
… | …0001101100010010111111 |
3 | 1022212122112011110101110112 |
4 | 2103130202301230102333 |
5 | 2312002134243144403 |
6 | 33314433202500235 |
7 | 2064020412012665 |
oct | 223344261542277 |
9 | 38778464411415 |
10 | 10132411303103 |
11 | 325714a035931 |
12 | 117789006467b |
13 | 58663677570b |
14 | 2705a895ac35 |
15 | 1288798119d8 |
hex | 93722c6c4bf |
10132411303103 has 4 divisors (see below), whose sum is σ = 10132439172168. Its totient is φ = 10132383434040.
The previous prime is 10132411303093. The next prime is 10132411303159. The reversal of 10132411303103 is 30130311423101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10132411303103 - 24 = 10132411303087 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 (10132411303163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13381868 + ... + 14118753.
It is an arithmetic number, because the mean of its divisors is an integer number (2533109793042).
Almost surely, 210132411303103 is an apocalyptic number.
10132411303103 is a deficient number, since it is larger than the sum of its proper divisors (27869065).
10132411303103 is an equidigital number, since it uses as much as digits as its factorization.
10132411303103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27869064.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10132411303103 its reverse (30130311423101), we get a palindrome (40262722726204).
The spelling of 10132411303103 in words is "ten trillion, one hundred thirty-two billion, four hundred eleven million, three hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •