Base | Representation |
---|---|
bin | 10011010000001111101… |
… | …100000010111111111111 |
3 | 11200111012000210012210020 |
4 | 103100033230002333333 |
5 | 133134213430211111 |
6 | 2451455122143223 |
7 | 164406656026065 |
oct | 23201754027777 |
9 | 4614160705706 |
10 | 1323113132031 |
11 | 4701469623a9 |
12 | 194517ab1b13 |
13 | 979cc747422 |
14 | 480790c6035 |
15 | 2463d130906 |
hex | 1340fb02fff |
1323113132031 has 8 divisors (see below), whose sum is σ = 1764164699904. Its totient is φ = 882068492760.
The previous prime is 1323113132027. The next prime is 1323113132051. The reversal of 1323113132031 is 1302313113231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1323113132031 - 22 = 1323113132027 is a prime.
It is a super-2 number, since 2×13231131320312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1323113131992 and 1323113132010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323113132021) 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, 1268865 + ... + 2063066.
It is an arithmetic number, because the mean of its divisors is an integer number (220520587488).
Almost surely, 21323113132031 is an apocalyptic number.
1323113132031 is a deficient number, since it is larger than the sum of its proper divisors (441051567873).
1323113132031 is a wasteful number, since it uses less digits than its factorization.
1323113132031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3464301.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 1323113132031 its reverse (1302313113231), we get a palindrome (2625426245262).
The spelling of 1323113132031 in words is "one trillion, three hundred twenty-three billion, one hundred thirteen million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •