Base | Representation |
---|---|
bin | 100101101001010011100000… |
… | …0111110000000110000111001 |
3 | 1121102102221102111101020012002 |
4 | 1023102213000332000300321 |
5 | 321400233003230214431 |
6 | 3132132032020430345 |
7 | 126514343565550235 |
oct | 11322470076006071 |
9 | 1542387374336162 |
10 | 331132331101241 |
11 | 9656648433944a |
12 | 3117b7b78483b5 |
13 | 1129c84c928867 |
14 | 5baac6713b5c5 |
15 | 28437a26c93cb |
hex | 12d29c0f80c39 |
331132331101241 has 8 divisors (see below), whose sum is σ = 345875958095424. Its totient is φ = 316417584867120.
The previous prime is 331132331101237. The next prime is 331132331101307. The reversal of 331132331101241 is 142101133231133.
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 331132331101241 - 22 = 331132331101237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (331132331101441) 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, 7220166575 + ... + 7220212436.
It is an arithmetic number, because the mean of its divisors is an integer number (43234494761928).
Almost surely, 2331132331101241 is an apocalyptic number.
It is an amenable number.
331132331101241 is a deficient number, since it is larger than the sum of its proper divisors (14743626994183).
331132331101241 is a wasteful number, since it uses less digits than its factorization.
331132331101241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14440380031.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 331132331101241 its reverse (142101133231133), we get a palindrome (473233464332374).
The spelling of 331132331101241 in words is "three hundred thirty-one trillion, one hundred thirty-two billion, three hundred thirty-one million, one hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •