Base | Representation |
---|---|
bin | 1011001100101101100101… |
… | …0000011011011111100001 |
3 | 1121121010001121202022100221 |
4 | 2303023121100123133201 |
5 | 3103214031413424441 |
6 | 42104305053243041 |
7 | 2410405100415550 |
oct | 263133120333741 |
9 | 47533047668327 |
10 | 12313021233121 |
11 | 3a17a17539294 |
12 | 146a419a93481 |
13 | 6b416111595b |
14 | 307d4c215d97 |
15 | 1654538278d1 |
hex | b32d941b7e1 |
12313021233121 has 16 divisors (see below), whose sum is σ = 14098576614400. Its totient is φ = 10534119171408.
The previous prime is 12313021233103. The next prime is 12313021233209. The reversal of 12313021233121 is 12133212031321.
It is not a de Polignac number, because 12313021233121 - 211 = 12313021231073 is a prime.
It is a super-2 number, since 2×123130212331212 (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 (12313021233221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9086686 + ... + 10353448.
It is an arithmetic number, because the mean of its divisors is an integer number (881161038400).
Almost surely, 212313021233121 is an apocalyptic number.
It is an amenable number.
12313021233121 is a deficient number, since it is larger than the sum of its proper divisors (1785555381279).
12313021233121 is a wasteful number, since it uses less digits than its factorization.
12313021233121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1269388.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 12313021233121 its reverse (12133212031321), we get a palindrome (24446233264442).
The spelling of 12313021233121 in words is "twelve trillion, three hundred thirteen billion, twenty-one million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •