Base | Representation |
---|---|
bin | 1001101001101011100001… |
… | …00001110110110110001011 |
3 | 2210010221002202101002102010 |
4 | 10310311300201312312023 |
5 | 10240210330230130011 |
6 | 113045505331511003 |
7 | 4320222454544541 |
oct | 464656041666613 |
9 | 83127082332363 |
10 | 21223321333131 |
11 | 684283a668965 |
12 | 246927b458463 |
13 | bac4733b7838 |
14 | 5352ddbdbd91 |
15 | 26c1021a61a6 |
hex | 134d70876d8b |
21223321333131 has 16 divisors (see below), whose sum is σ = 28307282984960. Its totient is φ = 14144120752320.
The previous prime is 21223321333127. The next prime is 21223321333139. The reversal of 21223321333131 is 13133312332212.
It is not a de Polignac number, because 21223321333131 - 22 = 21223321333127 is a prime.
It is a super-2 number, since 2×212233213331312 (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 (21223321333139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 231369366 + ... + 231461076.
It is an arithmetic number, because the mean of its divisors is an integer number (1769205186560).
Almost surely, 221223321333131 is an apocalyptic number.
21223321333131 is a deficient number, since it is larger than the sum of its proper divisors (7083961651829).
21223321333131 is a wasteful number, since it uses less digits than its factorization.
21223321333131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116826.
The product of its digits is 11664, while the sum is 30.
Adding to 21223321333131 its reverse (13133312332212), we get a palindrome (34356633665343).
The spelling of 21223321333131 in words is "twenty-one trillion, two hundred twenty-three billion, three hundred twenty-one million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •