Base | Representation |
---|---|
bin | 1010000001001110001011… |
… | …01001110011001001010011 |
3 | 2220000020222010120000201121 |
4 | 11000213011221303021103 |
5 | 10341433423023031011 |
6 | 114505242100143111 |
7 | 4432526352224551 |
oct | 500470551631123 |
9 | 86006863500647 |
10 | 22032203330131 |
11 | 7024894446445 |
12 | 2579ba4397a97 |
13 | c3a821539527 |
14 | 562515a1cbd1 |
15 | 283195115e71 |
hex | 1409c5a73253 |
22032203330131 has 16 divisors (see below), whose sum is σ = 22493732335200. Its totient is φ = 21576613536000.
The previous prime is 22032203330083. The next prime is 22032203330143. The reversal of 22032203330131 is 13103330223022.
It is a cyclic number.
It is not a de Polignac number, because 22032203330131 - 27 = 22032203330003 is a prime.
It is a super-2 number, since 2×220322033301312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22032203330096 and 22032203330105.
It is not an unprimeable number, because it can be changed into a prime (22032203300131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 859471 + ... + 6693511.
It is an arithmetic number, because the mean of its divisors is an integer number (1405858270950).
Almost surely, 222032203330131 is an apocalyptic number.
22032203330131 is a deficient number, since it is larger than the sum of its proper divisors (461529005069).
22032203330131 is a wasteful number, since it uses less digits than its factorization.
22032203330131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5834550.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 22032203330131 its reverse (13103330223022), we get a palindrome (35135533553153).
The spelling of 22032203330131 in words is "twenty-two trillion, thirty-two billion, two hundred three million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •