Base | Representation |
---|---|
bin | 1010000100011001100110… |
… | …00100111001000101100101 |
3 | 2220101200212011102220102202 |
4 | 11002030303010321011211 |
5 | 10400231103303100201 |
6 | 115031342545344245 |
7 | 4443443602014455 |
oct | 502146304710545 |
9 | 86350764386382 |
10 | 22141413331301 |
11 | 7067136666760 |
12 | 25971a2638085 |
13 | c47c071757b4 |
14 | 567915d1bd65 |
15 | 285e37baec6b |
hex | 142333139165 |
22141413331301 has 32 divisors (see below), whose sum is σ = 24327274102272. Its totient is φ = 19984978877760.
The previous prime is 22141413331229. The next prime is 22141413331309. The reversal of 22141413331301 is 10313331414122.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22141413331301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22141413331309) 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 31 ways as a sum of consecutive naturals, for example, 1847112830 + ... + 1847124816.
It is an arithmetic number, because the mean of its divisors is an integer number (760227315696).
Almost surely, 222141413331301 is an apocalyptic number.
It is an amenable number.
22141413331301 is a deficient number, since it is larger than the sum of its proper divisors (2185860770971).
22141413331301 is a wasteful number, since it uses less digits than its factorization.
22141413331301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14369.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 22141413331301 its reverse (10313331414122), we get a palindrome (32454744745423).
The spelling of 22141413331301 in words is "twenty-two trillion, one hundred forty-one billion, four hundred thirteen million, three hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •