Base | Representation |
---|---|
bin | 1011001101110001010011… |
… | …0111001101001010111001 |
3 | 1121122211222121102101220202 |
4 | 2303130110313031022321 |
5 | 3104013244441414001 |
6 | 42120513043331545 |
7 | 2411620442060135 |
oct | 263342467151271 |
9 | 47584877371822 |
10 | 12331201123001 |
11 | 3a246a6618672 |
12 | 1471a52380bb5 |
13 | 6b5a9a6abc47 |
14 | 308b948ac3c5 |
15 | 165b698b696b |
hex | b3714dcd2b9 |
12331201123001 has 8 divisors (see below), whose sum is σ = 12365149104000. Its totient is φ = 12297257893872.
The previous prime is 12331201122979. The next prime is 12331201123067. The reversal of 12331201123001 is 10032110213321.
It is a happy number.
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 12331201123001 - 238 = 12056323216057 is a prime.
It is a super-2 number, since 2×123312011230012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12331201123301) 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, 4040846 + ... + 6402408.
It is an arithmetic number, because the mean of its divisors is an integer number (1545643638000).
Almost surely, 212331201123001 is an apocalyptic number.
It is an amenable number.
12331201123001 is a deficient number, since it is larger than the sum of its proper divisors (33947980999).
12331201123001 is a wasteful number, since it uses less digits than its factorization.
12331201123001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2375935.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12331201123001 its reverse (10032110213321), we get a palindrome (22363311336322).
The spelling of 12331201123001 in words is "twelve trillion, three hundred thirty-one billion, two hundred one million, one hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •