Base | Representation |
---|---|
bin | 10111011100011101110011… |
… | …001010111001000111110001 |
3 | 111112002100001122210100212202 |
4 | 113130131303022321013301 |
5 | 102003333230300012241 |
6 | 1003144345323432545 |
7 | 30501352646554202 |
oct | 2734356312710761 |
9 | 445070048710782 |
10 | 103111212110321 |
11 | 2a944246150428 |
12 | b693788385755 |
13 | 456c46531748c |
14 | 1b66875c915a9 |
15 | bdc25c739d9b |
hex | 5dc7732b91f1 |
103111212110321 has 16 divisors (see below), whose sum is σ = 106530648795648. Its totient is φ = 99697630512000.
The previous prime is 103111212110297. The next prime is 103111212110443. The reversal of 103111212110321 is 123011212111301.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103111212110321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103111212110293 and 103111212110302.
It is not an unprimeable number, because it can be changed into a prime (103111212110021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 243450491 + ... + 243873663.
It is an arithmetic number, because the mean of its divisors is an integer number (6658165549728).
Almost surely, 2103111212110321 is an apocalyptic number.
It is an amenable number.
103111212110321 is a deficient number, since it is larger than the sum of its proper divisors (3419436685327).
103111212110321 is a wasteful number, since it uses less digits than its factorization.
103111212110321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430072.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 103111212110321 its reverse (123011212111301), we get a palindrome (226122424221622).
The spelling of 103111212110321 in words is "one hundred three trillion, one hundred eleven billion, two hundred twelve million, one hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •