Base | Representation |
---|---|
bin | 1001110001101110111011… |
… | …10001110100101100011111 |
3 | 2211010101100012120122001212 |
4 | 10320313131301310230133 |
5 | 10304224031212021421 |
6 | 113420551200455035 |
7 | 4346216560610135 |
oct | 470673561645437 |
9 | 84111305518055 |
10 | 21500032142111 |
11 | 693a126704256 |
12 | 24b2a2531a47b |
13 | bcc5a1272333 |
14 | 54486dc93755 |
15 | 2743e9e7de5b |
hex | 138dddc74b1f |
21500032142111 has 4 divisors (see below), whose sum is σ = 21708770318352. Its totient is φ = 21291293965872.
The previous prime is 21500032141997. The next prime is 21500032142123. The reversal of 21500032142111 is 11124123000512.
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-21500032142111 is a prime.
It is a super-2 number, since 2×215000321421112 (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 (21500032162111) 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, 104369087966 + ... + 104369088171.
It is an arithmetic number, because the mean of its divisors is an integer number (5427192579588).
Almost surely, 221500032142111 is an apocalyptic number.
21500032142111 is a deficient number, since it is larger than the sum of its proper divisors (208738176241).
21500032142111 is a wasteful number, since it uses less digits than its factorization.
21500032142111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208738176240.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 21500032142111 its reverse (11124123000512), we get a palindrome (32624155142623).
The spelling of 21500032142111 in words is "twenty-one trillion, five hundred billion, thirty-two million, one hundred forty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •