Base | Representation |
---|---|
bin | 10011010000001111100… |
… | …101000110101100000011 |
3 | 11200111011220100202100112 |
4 | 103100033211012230003 |
5 | 133134212443442011 |
6 | 2451455015141535 |
7 | 164406634406210 |
oct | 23201745065403 |
9 | 4614156322315 |
10 | 1323111312131 |
11 | 47014592a054 |
12 | 1945173748ab |
13 | 979cc25ac6b |
14 | 48078b70b07 |
15 | 2463cdc158b |
hex | 1340f946b03 |
1323111312131 has 8 divisors (see below), whose sum is σ = 1512160333824. Its totient is φ = 1134070570440.
The previous prime is 1323111312121. The next prime is 1323111312151. The reversal of 1323111312131 is 1312131113231.
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 1323111312131 - 210 = 1323111311107 is a prime.
It is a super-2 number, since 2×13231113121312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1323111312097 and 1323111312106.
It is not an unprimeable number, because it can be changed into a prime (1323111312121) 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, 1723715 + ... + 2370108.
It is an arithmetic number, because the mean of its divisors is an integer number (189020041728).
Almost surely, 21323111312131 is an apocalyptic number.
1323111312131 is a deficient number, since it is larger than the sum of its proper divisors (189049021693).
1323111312131 is an equidigital number, since it uses as much as digits as its factorization.
1323111312131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4140001.
The product of its digits is 324, while the sum is 23.
Adding to 1323111312131 its reverse (1312131113231), we get a palindrome (2635242425362).
The spelling of 1323111312131 in words is "one trillion, three hundred twenty-three billion, one hundred eleven million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •