Base | Representation |
---|---|
bin | 1011001101010011100010… |
… | …0111110000110110011111 |
3 | 1121122002100202211012100211 |
4 | 2303110320213300312133 |
5 | 3103400414021320111 |
6 | 42113112142033251 |
7 | 2411215442134630 |
oct | 263247047606637 |
9 | 47562322735324 |
10 | 12323211120031 |
11 | 3a21276459129 |
12 | 14703a2578827 |
13 | 6b50c6259236 |
14 | 308637687887 |
15 | 16584d1e3521 |
hex | b35389f0d9f |
12323211120031 has 32 divisors (see below), whose sum is σ = 15171058073600. Its totient is φ = 9773214161760.
The previous prime is 12323211120001. The next prime is 12323211120049. The reversal of 12323211120031 is 13002111232321.
It is a de Polignac number, because none of the positive numbers 2k-12323211120031 is a prime.
It is a super-2 number, since 2×123232111200312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12323211119984 and 12323211120011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12323211120001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66929026 + ... + 67112896.
It is an arithmetic number, because the mean of its divisors is an integer number (474095564800).
Almost surely, 212323211120031 is an apocalyptic number.
12323211120031 is a deficient number, since it is larger than the sum of its proper divisors (2847846953569).
12323211120031 is a wasteful number, since it uses less digits than its factorization.
12323211120031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195659.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12323211120031 its reverse (13002111232321), we get a palindrome (25325322352352).
The spelling of 12323211120031 in words is "twelve trillion, three hundred twenty-three billion, two hundred eleven million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •