Base | Representation |
---|---|
bin | 1011001101110000101010… |
… | …1110100111111100101111 |
3 | 1121122211112202111101220011 |
4 | 2303130022232213330233 |
5 | 3104012422430214411 |
6 | 42120444131234051 |
7 | 2411613305650633 |
oct | 263341256477457 |
9 | 47584482441804 |
10 | 12331031101231 |
11 | 3a24619650807 |
12 | 1471a05448927 |
13 | 6b5a713bca4b |
14 | 308b7a090dc3 |
15 | 165b599cec21 |
hex | b370aba7f2f |
12331031101231 has 8 divisors (see below), whose sum is σ = 12351759704928. Its totient is φ = 12310303200000.
The previous prime is 12331031101219. The next prime is 12331031101267. The reversal of 12331031101231 is 13210113013321.
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 12331031101231 - 215 = 12331031068463 is a prime.
It is a super-2 number, since 2×123310311012312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12331031101211) 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, 44474631 + ... + 44751031.
It is an arithmetic number, because the mean of its divisors is an integer number (1543969963116).
Almost surely, 212331031101231 is an apocalyptic number.
12331031101231 is a deficient number, since it is larger than the sum of its proper divisors (20728603697).
12331031101231 is an equidigital number, since it uses as much as digits as its factorization.
12331031101231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351233.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 12331031101231 its reverse (13210113013321), we get a palindrome (25541144114552).
The spelling of 12331031101231 in words is "twelve trillion, three hundred thirty-one billion, thirty-one million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •