Base | Representation |
---|---|
bin | 1001001001011101011001… |
… | …11011000111101001011101 |
3 | 2122020002111212102000110212 |
4 | 10210232230323013221131 |
5 | 10114041021123314031 |
6 | 110441134143142205 |
7 | 4144231002316130 |
oct | 444565473075135 |
9 | 78202455360425 |
10 | 20116233026141 |
11 | 6456279128a1a |
12 | 230a7b18a4965 |
13 | b2bc4cc28195 |
14 | 4d78b918c217 |
15 | 24d40929612b |
hex | 124bacec7a5d |
20116233026141 has 32 divisors (see below), whose sum is σ = 25012642959360. Its totient is φ = 15794813232576.
The previous prime is 20116233026069. The next prime is 20116233026177. The reversal of 20116233026141 is 14162033261102.
It is a de Polignac number, because none of the positive numbers 2k-20116233026141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20116233026098 and 20116233026107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20116233026341) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18867206 + ... + 19904871.
It is an arithmetic number, because the mean of its divisors is an integer number (781645092480).
Almost surely, 220116233026141 is an apocalyptic number.
It is an amenable number.
20116233026141 is a deficient number, since it is larger than the sum of its proper divisors (4896409933219).
20116233026141 is a wasteful number, since it uses less digits than its factorization.
20116233026141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38772233.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 20116233026141 its reverse (14162033261102), we get a palindrome (34278266287243).
The spelling of 20116233026141 in words is "twenty trillion, one hundred sixteen billion, two hundred thirty-three million, twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •