Base | Representation |
---|---|
bin | 1010100011100011111101… |
… | …10101100000000111110001 |
3 | 10001012001120100001101200211 |
4 | 11101301332311200013301 |
5 | 11020301421043101001 |
6 | 121211301133544121 |
7 | 4614010151640121 |
oct | 521617665400761 |
9 | 101161510041624 |
10 | 23212131222001 |
11 | 743a233a32617 |
12 | 272a7bb945041 |
13 | cc4b82520377 |
14 | 5a368a450c81 |
15 | 2a3c02a90351 |
hex | 151c7ed601f1 |
23212131222001 has 8 divisors (see below), whose sum is σ = 23720630742144. Its totient is φ = 22704241051440.
The previous prime is 23212131221989. The next prime is 23212131222011. The reversal of 23212131222001 is 10022213121232.
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 23212131222001 - 25 = 23212131221969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23212131222011) 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, 152260375 + ... + 152412748.
It is an arithmetic number, because the mean of its divisors is an integer number (2965078842768).
Almost surely, 223212131222001 is an apocalyptic number.
It is an amenable number.
23212131222001 is a deficient number, since it is larger than the sum of its proper divisors (508499520143).
23212131222001 is a wasteful number, since it uses less digits than its factorization.
23212131222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304674791.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 23212131222001 its reverse (10022213121232), we get a palindrome (33234344343233).
The spelling of 23212131222001 in words is "twenty-three trillion, two hundred twelve billion, one hundred thirty-one million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •