Base | Representation |
---|---|
bin | 100101101001010011011010… |
… | …0100100101000000110010110 |
3 | 1121102102220220000000200120222 |
4 | 1023102212310210220012112 |
5 | 321400232042004320042 |
6 | 3132131555230554342 |
7 | 126514335462002060 |
oct | 11322466444500626 |
9 | 1542386800020528 |
10 | 331132123120022 |
11 | 965663879a5044 |
12 | 3117b75a0689b2 |
13 | 1129c818808853 |
14 | 5baac4767c730 |
15 | 284378e2e52d2 |
hex | 12d29b4928196 |
331132123120022 has 8 divisors (see below), whose sum is σ = 567655068205776. Its totient is φ = 141913767051432.
The previous prime is 331132123120013. The next prime is 331132123120031. The reversal of 331132123120022 is 220021321231133.
It is an interprime number because it is at equal distance from previous prime (331132123120013) and next prime (331132123120031).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 331132123119973 and 331132123120000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11826147254273 + ... + 11826147254300.
It is an arithmetic number, because the mean of its divisors is an integer number (70956883525722).
Almost surely, 2331132123120022 is an apocalyptic number.
331132123120022 is a deficient number, since it is larger than the sum of its proper divisors (236522945085754).
331132123120022 is a wasteful number, since it uses less digits than its factorization.
331132123120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23652294508582.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 331132123120022 its reverse (220021321231133), we get a palindrome (551153444351155).
The spelling of 331132123120022 in words is "three hundred thirty-one trillion, one hundred thirty-two billion, one hundred twenty-three million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •