Base | Representation |
---|---|
bin | 10111011100011101110011… |
… | …000100000010010100111101 |
3 | 111112002100001112102001110002 |
4 | 113130131303010002110331 |
5 | 102003333224320004041 |
6 | 1003144345221124045 |
7 | 30501352625360231 |
oct | 2734356304022475 |
9 | 445070045361402 |
10 | 103111210313021 |
11 | 2a944245133059 |
12 | b693787859625 |
13 | 456c464b383a1 |
14 | 1b668759445c1 |
15 | bdc25c4d259b |
hex | 5dc77310253d |
103111210313021 has 16 divisors (see below), whose sum is σ = 104322611527680. Its totient is φ = 101906551839600.
The previous prime is 103111210312973. The next prime is 103111210313131. The reversal of 103111210313021 is 120313012111301.
It is a cyclic number.
It is not a de Polignac number, because 103111210313021 - 210 = 103111210311997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103111210312984 and 103111210313002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103111210315021) 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, 1219472696 + ... + 1219557246.
It is an arithmetic number, because the mean of its divisors is an integer number (6520163220480).
Almost surely, 2103111210313021 is an apocalyptic number.
It is an amenable number.
103111210313021 is a deficient number, since it is larger than the sum of its proper divisors (1211401214659).
103111210313021 is a wasteful number, since it uses less digits than its factorization.
103111210313021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124256.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 103111210313021 its reverse (120313012111301), we get a palindrome (223424222424322).
The spelling of 103111210313021 in words is "one hundred three trillion, one hundred eleven billion, two hundred ten million, three hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •