Base | Representation |
---|---|
bin | 1001111000100000010000… |
… | …00111111010110000011001 |
3 | 2211221121211012021111101201 |
4 | 10330100020013322300121 |
5 | 10322032002211424121 |
6 | 114115503502514201 |
7 | 4402063561636522 |
oct | 474201007726031 |
9 | 84847735244351 |
10 | 21732670811161 |
11 | 6a19857115602 |
12 | 252bb2b595961 |
13 | c184c751831b |
14 | 551c1ca09849 |
15 | 27a4b39e9e91 |
hex | 13c4081fac19 |
21732670811161 has 4 divisors (see below), whose sum is σ = 21779609625472. Its totient is φ = 21685731996852.
The previous prime is 21732670811113. The next prime is 21732670811191. The reversal of 21732670811161 is 16111807623712.
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 21732670811161 - 29 = 21732670810649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21732670811191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23469406461 + ... + 23469407386.
It is an arithmetic number, because the mean of its divisors is an integer number (5444902406368).
Almost surely, 221732670811161 is an apocalyptic number.
It is an amenable number.
21732670811161 is a deficient number, since it is larger than the sum of its proper divisors (46938814311).
21732670811161 is an equidigital number, since it uses as much as digits as its factorization.
21732670811161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46938814310.
The product of its (nonzero) digits is 169344, while the sum is 46.
The spelling of 21732670811161 in words is "twenty-one trillion, seven hundred thirty-two billion, six hundred seventy million, eight hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •