Base | Representation |
---|---|
bin | 1010000100001000001111… |
… | …11110100000010110010111 |
3 | 2220100210211010100000021011 |
4 | 11002010013332200112113 |
5 | 10400103020134132411 |
6 | 115023202503033051 |
7 | 4442664035410303 |
oct | 502040776402627 |
9 | 86323733300234 |
10 | 22132100302231 |
11 | 7063197702117 |
12 | 259542373b787 |
13 | c470818b51ca |
14 | 5672b1100d03 |
15 | 285a9029dc21 |
hex | 142107fa0597 |
22132100302231 has 4 divisors (see below), whose sum is σ = 22137077167552. Its totient is φ = 22127123436912.
The previous prime is 22132100302183. The next prime is 22132100302271. The reversal of 22132100302231 is 13220300123122.
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 22132100302231 - 215 = 22132100269463 is a prime.
It is a super-2 number, since 2×221321003022312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22132100302271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2488425990 + ... + 2488434883.
It is an arithmetic number, because the mean of its divisors is an integer number (5534269291888).
Almost surely, 222132100302231 is an apocalyptic number.
22132100302231 is a deficient number, since it is larger than the sum of its proper divisors (4976865321).
22132100302231 is an equidigital number, since it uses as much as digits as its factorization.
22132100302231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4976865320.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 22132100302231 its reverse (13220300123122), we get a palindrome (35352400425353).
The spelling of 22132100302231 in words is "twenty-two trillion, one hundred thirty-two billion, one hundred million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •