Base | Representation |
---|---|
bin | 1001110010111111000001… |
… | …01011010010100100111111 |
3 | 2211021111022211110011222012 |
4 | 10321133200223102210333 |
5 | 10310430111242342421 |
6 | 113452422003241435 |
7 | 4352301243221054 |
oct | 471374053224477 |
9 | 84244284404865 |
10 | 21543030434111 |
11 | 695639106646a |
12 | 24bb22537927b |
13 | c0366455b874 |
14 | 54698c74102b |
15 | 2755b4cbd95b |
hex | 1397e0ad293f |
21543030434111 has 4 divisors (see below), whose sum is σ = 21545509788000. Its totient is φ = 21540551080224.
The previous prime is 21543030434099. The next prime is 21543030434117. The reversal of 21543030434111 is 11143403034512.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21543030434111 - 26 = 21543030434047 is a prime.
It is a super-2 number, since 2×215430304341112 (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 (21543030434117) 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, 1239663911 + ... + 1239681288.
It is an arithmetic number, because the mean of its divisors is an integer number (5386377447000).
Almost surely, 221543030434111 is an apocalyptic number.
21543030434111 is a deficient number, since it is larger than the sum of its proper divisors (2479353889).
21543030434111 is an equidigital number, since it uses as much as digits as its factorization.
21543030434111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2479353888.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 21543030434111 its reverse (11143403034512), we get a palindrome (32686433468623).
The spelling of 21543030434111 in words is "twenty-one trillion, five hundred forty-three billion, thirty million, four hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •