Base | Representation |
---|---|
bin | 1001100111010001001000… |
… | …00001001100100001100011 |
3 | 2202212000011010221221211212 |
4 | 10303220210001030201203 |
5 | 10232331101412333011 |
6 | 112543440410100335 |
7 | 4311226434233612 |
oct | 463504401144143 |
9 | 82760133857755 |
10 | 21140433324131 |
11 | 6810675532990 |
12 | 24551a841a6ab |
13 | ba46c3b4cb74 |
14 | 5312b968d879 |
15 | 269da03b608b |
hex | 133a2404c863 |
21140433324131 has 32 divisors (see below), whose sum is σ = 23584180838400. Its totient is φ = 18789523632000.
The previous prime is 21140433324121. The next prime is 21140433324161. The reversal of 21140433324131 is 13142333404112.
It is a de Polignac number, because none of the positive numbers 2k-21140433324131 is a prime.
It is a super-2 number, since 2×211404333241312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21140433324121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39672446 + ... + 40201788.
It is an arithmetic number, because the mean of its divisors is an integer number (737005651200).
Almost surely, 221140433324131 is an apocalyptic number.
21140433324131 is a deficient number, since it is larger than the sum of its proper divisors (2443747514269).
21140433324131 is a wasteful number, since it uses less digits than its factorization.
21140433324131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529907.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 21140433324131 its reverse (13142333404112), we get a palindrome (34282766728243).
The spelling of 21140433324131 in words is "twenty-one trillion, one hundred forty billion, four hundred thirty-three million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •