Base | Representation |
---|---|
bin | 1001100111110111011101… |
… | …10000001100100000011001 |
3 | 2202220222021111002121110221 |
4 | 10303323232300030200121 |
5 | 10233200224203333031 |
6 | 113001122540240041 |
7 | 4312555444365004 |
oct | 463735660144031 |
9 | 82828244077427 |
10 | 21161014511641 |
11 | 6819377030764 |
12 | 2459190b40021 |
13 | ba6623a67624 |
14 | 5322acc2253b |
15 | 26a6a7185a11 |
hex | 133eeec0c819 |
21161014511641 has 8 divisors (see below), whose sum is σ = 21363111310464. Its totient is φ = 20958997903920.
The previous prime is 21161014511543. The next prime is 21161014511671. The reversal of 21161014511641 is 14611541016112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21161014511641 - 29 = 21161014511129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21161014511597 and 21161014511606.
It is not an unprimeable number, because it can be changed into a prime (21161014511671) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19517425 + ... + 20573086.
It is an arithmetic number, because the mean of its divisors is an integer number (2670388913808).
Almost surely, 221161014511641 is an apocalyptic number.
It is an amenable number.
21161014511641 is a deficient number, since it is larger than the sum of its proper divisors (202096798823).
21161014511641 is a wasteful number, since it uses less digits than its factorization.
21161014511641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40095551.
The product of its (nonzero) digits is 5760, while the sum is 34.
Adding to 21161014511641 its reverse (14611541016112), we get a palindrome (35772555527753).
The spelling of 21161014511641 in words is "twenty-one trillion, one hundred sixty-one billion, fourteen million, five hundred eleven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •