Base | Representation |
---|---|
bin | 1010000000101010101001… |
… | …10111011110100100110111 |
3 | 2212221102201222000111212120 |
4 | 11000111110313132210313 |
5 | 10341130343043040203 |
6 | 114452405354451023 |
7 | 4431252625042665 |
oct | 500252467364467 |
9 | 85842658014776 |
10 | 22013131221303 |
11 | 7017797769832 |
12 | 2576361133a73 |
13 | c38aa2172431 |
14 | 561626a73c35 |
15 | 28292aa85b53 |
hex | 140554dde937 |
22013131221303 has 16 divisors (see below), whose sum is σ = 29356513555680. Its totient is φ = 14672585163776.
The previous prime is 22013131221233. The next prime is 22013131221313. The reversal of 22013131221303 is 30312213131022.
It is a cyclic number.
It is not a de Polignac number, because 22013131221303 - 213 = 22013131213111 is a prime.
It is a super-2 number, since 2×220131312213032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22013131221313) 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, 400816201 + ... + 400871117.
It is an arithmetic number, because the mean of its divisors is an integer number (1834782097230).
Almost surely, 222013131221303 is an apocalyptic number.
22013131221303 is a deficient number, since it is larger than the sum of its proper divisors (7343382334377).
22013131221303 is a wasteful number, since it uses less digits than its factorization.
22013131221303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78306.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 22013131221303 its reverse (30312213131022), we get a palindrome (52325344352325).
The spelling of 22013131221303 in words is "twenty-two trillion, thirteen billion, one hundred thirty-one million, two hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •