Base | Representation |
---|---|
bin | 1010000100001000001000… |
… | …00010000001001010100111 |
3 | 2220100210122111210022101011 |
4 | 11002010010002001022213 |
5 | 10400102401213123330 |
6 | 115023152140243051 |
7 | 4442662303001314 |
oct | 502040402011247 |
9 | 86323574708334 |
10 | 22132034114215 |
11 | 7063163305083 |
12 | 2595405540487 |
13 | c47070c7c7bc |
14 | 5672a63d1d0b |
15 | 285a8957782a |
hex | 1421040812a7 |
22132034114215 has 4 divisors (see below), whose sum is σ = 26558440937064. Its totient is φ = 17705627291368.
The previous prime is 22132034114213. The next prime is 22132034114221. The reversal of 22132034114215 is 51241143023122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22132034114215 - 21 = 22132034114213 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 (22132034114213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2213203411417 + ... + 2213203411426.
It is an arithmetic number, because the mean of its divisors is an integer number (6639610234266).
Almost surely, 222132034114215 is an apocalyptic number.
22132034114215 is a deficient number, since it is larger than the sum of its proper divisors (4426406822849).
22132034114215 is an equidigital number, since it uses as much as digits as its factorization.
22132034114215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4426406822848.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 22132034114215 its reverse (51241143023122), we get a palindrome (73373177137337).
The spelling of 22132034114215 in words is "twenty-two trillion, one hundred thirty-two billion, thirty-four million, one hundred fourteen thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •