Base | Representation |
---|---|
bin | 1010000100001000101010… |
… | …10011111011111111101101 |
3 | 2220100211101201022021020202 |
4 | 11002010111103323333231 |
5 | 10400103444422234201 |
6 | 115023241014123245 |
7 | 4443002423125241 |
oct | 502042523737755 |
9 | 86324351267222 |
10 | 22132324024301 |
11 | 70632a1a17897 |
12 | 2595486650525 |
13 | c470b9056b2a |
14 | 5672d2ada421 |
15 | 285aa4c41c6b |
hex | 1421154fbfed |
22132324024301 has 4 divisors (see below), whose sum is σ = 22141754075232. Its totient is φ = 22122893973372.
The previous prime is 22132324024267. The next prime is 22132324024351. The reversal of 22132324024301 is 10342042323122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22132324024301 - 214 = 22132324007917 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 (22132324024351) 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, 4715021945 + ... + 4715026638.
It is an arithmetic number, because the mean of its divisors is an integer number (5535438518808).
Almost surely, 222132324024301 is an apocalyptic number.
It is an amenable number.
22132324024301 is a deficient number, since it is larger than the sum of its proper divisors (9430050931).
22132324024301 is an equidigital number, since it uses as much as digits as its factorization.
22132324024301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9430050930.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 22132324024301 its reverse (10342042323122), we get a palindrome (32474366347423).
The spelling of 22132324024301 in words is "twenty-two trillion, one hundred thirty-two billion, three hundred twenty-four million, twenty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •