Base | Representation |
---|---|
bin | 1001001001100110110001… |
… | …01111100001010111001111 |
3 | 2122020120111102110210221122 |
4 | 10210303120233201113033 |
5 | 10114131321331304133 |
6 | 110443325232151155 |
7 | 4144466441550632 |
oct | 444633057412717 |
9 | 78216442423848 |
10 | 20121263150543 |
11 | 645841a540925 |
12 | 230b7763984bb |
13 | b2c5720a3559 |
14 | 4d7c35251c19 |
15 | 24d600b9d498 |
hex | 124cd8be15cf |
20121263150543 has 4 divisors (see below), whose sum is σ = 20121566234328. Its totient is φ = 20120960066760.
The previous prime is 20121263150507. The next prime is 20121263150683. The reversal of 20121263150543 is 34505136212102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20121263150543 is a prime.
It is a super-2 number, since 2×201212631505432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121263450543) 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, 151442288 + ... + 151575093.
It is an arithmetic number, because the mean of its divisors is an integer number (5030391558582).
Almost surely, 220121263150543 is an apocalyptic number.
20121263150543 is a deficient number, since it is larger than the sum of its proper divisors (303083785).
20121263150543 is an equidigital number, since it uses as much as digits as its factorization.
20121263150543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303083784.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 20121263150543 its reverse (34505136212102), we get a palindrome (54626399362645).
The spelling of 20121263150543 in words is "twenty trillion, one hundred twenty-one billion, two hundred sixty-three million, one hundred fifty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •