Base | Representation |
---|---|
bin | 1001001001100110100001… |
… | …10111110100111011111101 |
3 | 2122020120011020000110120101 |
4 | 10210303100313310323331 |
5 | 10114131034031011031 |
6 | 110443304154121101 |
7 | 4144463246331325 |
oct | 444632067647375 |
9 | 78216136013511 |
10 | 20121131110141 |
11 | 6458361a55a26 |
12 | 230b73a120191 |
13 | b2c550922139 |
14 | 4d7c218c0285 |
15 | 24d5e42ba361 |
hex | 124cd0df4efd |
20121131110141 has 4 divisors (see below), whose sum is σ = 20126472534432. Its totient is φ = 20115789685852.
The previous prime is 20121131110081. The next prime is 20121131110147. The reversal of 20121131110141 is 14101113112102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20121131110141 - 233 = 20112541175549 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 (20121131110147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2670706495 + ... + 2670714028.
It is an arithmetic number, because the mean of its divisors is an integer number (5031618133608).
Almost surely, 220121131110141 is an apocalyptic number.
It is an amenable number.
20121131110141 is a deficient number, since it is larger than the sum of its proper divisors (5341424291).
20121131110141 is an equidigital number, since it uses as much as digits as its factorization.
20121131110141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5341424290.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 20121131110141 its reverse (14101113112102), we get a palindrome (34222244222243).
The spelling of 20121131110141 in words is "twenty trillion, one hundred twenty-one billion, one hundred thirty-one million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •