Base | Representation |
---|---|
bin | 1010000100001000101011… |
… | …10111011100011000101101 |
3 | 2220100211102100211011000211 |
4 | 11002010111313130120231 |
5 | 10400104004313111023 |
6 | 115023241545422421 |
7 | 4443002565212362 |
oct | 502042567343055 |
9 | 86324370734024 |
10 | 22132333332013 |
11 | 70632a71a4913 |
12 | 259548979aa11 |
13 | c470bac65558 |
14 | 5672d4040469 |
15 | 285aa597ea0d |
hex | 142115ddc62d |
22132333332013 has 4 divisors (see below), whose sum is σ = 22132478744928. Its totient is φ = 22132187919100.
The previous prime is 22132333332001. The next prime is 22132333332037. The reversal of 22132333332013 is 31023333323122.
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 22132333332013 - 221 = 22132331234861 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 (22132333332313) 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, 72477913 + ... + 72782638.
It is an arithmetic number, because the mean of its divisors is an integer number (5533119686232).
Almost surely, 222132333332013 is an apocalyptic number.
It is an amenable number.
22132333332013 is a deficient number, since it is larger than the sum of its proper divisors (145412915).
22132333332013 is a wasteful number, since it uses less digits than its factorization.
22132333332013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145412914.
The product of its (nonzero) digits is 34992, while the sum is 31.
Adding to 22132333332013 its reverse (31023333323122), we get a palindrome (53155666655135).
The spelling of 22132333332013 in words is "twenty-two trillion, one hundred thirty-two billion, three hundred thirty-three million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •