Base | Representation |
---|---|
bin | 1011001101110100010111… |
… | …0010100110110101101001 |
3 | 1121122221002211001022211122 |
4 | 2303131011302212311221 |
5 | 3104021440113013001 |
6 | 42121130325505025 |
7 | 2411650000320353 |
oct | 263350562466551 |
9 | 47587084038748 |
10 | 12332022001001 |
11 | 3a24a87a1943a |
12 | 1472041272175 |
13 | 6b5b9b791a81 |
14 | 308c319100d3 |
15 | 165bb69b4b1b |
hex | b3745ca6d69 |
12332022001001 has 4 divisors (see below), whose sum is σ = 12459156248532. Its totient is φ = 12204887753472.
The previous prime is 12332022000979. The next prime is 12332022001031. The reversal of 12332022001001 is 10010022023321.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3781076361001 + 8550945640000 = 1944499^2 + 2924200^2 .
It is a cyclic number.
It is not a de Polignac number, because 12332022001001 - 210 = 12332021999977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12332022001031) 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, 63567123620 + ... + 63567123813.
It is an arithmetic number, because the mean of its divisors is an integer number (3114789062133).
Almost surely, 212332022001001 is an apocalyptic number.
It is an amenable number.
12332022001001 is a deficient number, since it is larger than the sum of its proper divisors (127134247531).
12332022001001 is an equidigital number, since it uses as much as digits as its factorization.
12332022001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127134247530.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12332022001001 its reverse (10010022023321), we get a palindrome (22342044024322).
The spelling of 12332022001001 in words is "twelve trillion, three hundred thirty-two billion, twenty-two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •