Base | Representation |
---|---|
bin | 1011001101110001011010… |
… | …0110100011011001000001 |
3 | 1121122212001122100100200211 |
4 | 2303130112212203121001 |
5 | 3104013324424441001 |
6 | 42120520005114121 |
7 | 2411621245140226 |
oct | 263342646433101 |
9 | 47585048310624 |
10 | 12331230312001 |
11 | 3a24711044807 |
12 | 1471a600b8941 |
13 | 6b5aa375ba43 |
14 | 308b9870994d |
15 | 165b6c230351 |
hex | b37169a3641 |
12331230312001 has 8 divisors (see below), whose sum is σ = 12608360843904. Its totient is φ = 12054714943920.
The previous prime is 12331230311993. The next prime is 12331230312017. The reversal of 12331230312001 is 10021303213321.
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 12331230312001 - 23 = 12331230311993 is a prime.
It is a super-2 number, since 2×123312303120012 (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 (12331230312041) 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, 153750415 + ... + 153830596.
It is an arithmetic number, because the mean of its divisors is an integer number (1576045105488).
Almost surely, 212331230312001 is an apocalyptic number.
It is an amenable number.
12331230312001 is a deficient number, since it is larger than the sum of its proper divisors (277130531903).
12331230312001 is an equidigital number, since it uses as much as digits as its factorization.
12331230312001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307581911.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12331230312001 its reverse (10021303213321), we get a palindrome (22352533525322).
The spelling of 12331230312001 in words is "twelve trillion, three hundred thirty-one billion, two hundred thirty million, three hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •