Base | Representation |
---|---|
bin | 10011010000001111100… |
… | …101000110101100000101 |
3 | 11200111011220100202100121 |
4 | 103100033211012230011 |
5 | 133134212443442013 |
6 | 2451455015141541 |
7 | 164406634406212 |
oct | 23201745065405 |
9 | 4614156322317 |
10 | 1323111312133 |
11 | 47014592a056 |
12 | 1945173748b1 |
13 | 979cc25ac70 |
14 | 48078b70b09 |
15 | 2463cdc158d |
hex | 1340f946b05 |
1323111312133 has 16 divisors (see below), whose sum is σ = 1465192624896. Its totient is φ = 1187014181760.
The previous prime is 1323111312121. The next prime is 1323111312151. The reversal of 1323111312133 is 3312131113231.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1323111312133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1323111312098 and 1323111312107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323111312113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4579185 + ... + 4859542.
It is an arithmetic number, because the mean of its divisors is an integer number (91574539056).
Almost surely, 21323111312133 is an apocalyptic number.
1323111312133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1323111312133 is a deficient number, since it is larger than the sum of its proper divisors (142081312763).
1323111312133 is a wasteful number, since it uses less digits than its factorization.
1323111312133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9439044.
The product of its digits is 972, while the sum is 25.
Adding to 1323111312133 its reverse (3312131113231), we get a palindrome (4635242425364).
The spelling of 1323111312133 in words is "one trillion, three hundred twenty-three billion, one hundred eleven million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •