Base | Representation |
---|---|
bin | 101111000010001110110… |
… | …111001010101110011001 |
3 | 102102222220102112221122101 |
4 | 233002032313022232121 |
5 | 410424032312424423 |
6 | 10512505141323401 |
7 | 452343142446133 |
oct | 57021667125631 |
9 | 12388812487571 |
10 | 3232212233113 |
11 | 10368565a6436 |
12 | 442511406561 |
13 | 1a5a47639936 |
14 | b2623166053 |
15 | 59125b287ad |
hex | 2f08edcab99 |
3232212233113 has 8 divisors (see below), whose sum is σ = 3234196135296. Its totient is φ = 3230228778000.
The previous prime is 3232212233101. The next prime is 3232212233147. The reversal of 3232212233113 is 3113322122323.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3232212233113 - 233 = 3223622298521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3232212231113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14971888 + ... + 15186238.
It is an arithmetic number, because the mean of its divisors is an integer number (404274516912).
Almost surely, 23232212233113 is an apocalyptic number.
It is an amenable number.
3232212233113 is a deficient number, since it is larger than the sum of its proper divisors (1983902183).
3232212233113 is a wasteful number, since it uses less digits than its factorization.
3232212233113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223535.
The product of its digits is 7776, while the sum is 28.
Adding to 3232212233113 its reverse (3113322122323), we get a palindrome (6345534355436).
The spelling of 3232212233113 in words is "three trillion, two hundred thirty-two billion, two hundred twelve million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •