Base | Representation |
---|---|
bin | 101111000010010100101… |
… | …100111011100111111001 |
3 | 102110000011020220211221021 |
4 | 233002110230323213321 |
5 | 410424232403304423 |
6 | 10512523001342441 |
7 | 452345442326122 |
oct | 57022454734771 |
9 | 12400136824837 |
10 | 3232310213113 |
11 | 10368a6938243 |
12 | 44253a197a21 |
13 | 1a5a61a23b77 |
14 | b263218d049 |
15 | 5912e52e95d |
hex | 2f094b3b9f9 |
3232310213113 has 8 divisors (see below), whose sum is σ = 3423157278408. Its totient is φ = 3041542166784.
The previous prime is 3232310212993. The next prime is 3232310213123. The reversal of 3232310213113 is 3113120132323.
It can be written as a sum of positive squares in 4 ways, for example, as 1660263174144 + 1572047038969 = 1288512^2 + 1253813^2 .
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 3232310213113 - 29 = 3232310212601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3232310213123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19670506 + ... + 19834147.
It is an arithmetic number, because the mean of its divisors is an integer number (427894659801).
Almost surely, 23232310213113 is an apocalyptic number.
It is an amenable number.
3232310213113 is a deficient number, since it is larger than the sum of its proper divisors (190847065295).
3232310213113 is a wasteful number, since it uses less digits than its factorization.
3232310213113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39509483.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 3232310213113 its reverse (3113120132323), we get a palindrome (6345430345436).
The spelling of 3232310213113 in words is "three trillion, two hundred thirty-two billion, three hundred ten million, two hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •