Base | Representation |
---|---|
bin | 10011001110100110010… |
… | …000100100011111111011 |
3 | 11200022121202110022221020 |
4 | 103032212100210133323 |
5 | 133122103121242111 |
6 | 2451003414313523 |
7 | 164315100263133 |
oct | 23164620443773 |
9 | 4608552408836 |
10 | 1321344321531 |
11 | 46a419470943 |
12 | 1941036588a3 |
13 | 977aa1578b0 |
14 | 47d4c20bac3 |
15 | 24587bd8906 |
hex | 133a64247fb |
1321344321531 has 8 divisors (see below), whose sum is σ = 1897314923280. Its totient is φ = 813134967072.
The previous prime is 1321344321529. The next prime is 1321344321569. The reversal of 1321344321531 is 1351234431231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1321344321531 - 21 = 1321344321529 is a prime.
It is a super-2 number, since 2×13213443215312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1321344321492 and 1321344321501.
It is not an unprimeable number, because it can be changed into a prime (1321344328531) 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, 16940311776 + ... + 16940311853.
It is an arithmetic number, because the mean of its divisors is an integer number (237164365410).
Almost surely, 21321344321531 is an apocalyptic number.
1321344321531 is a deficient number, since it is larger than the sum of its proper divisors (575970601749).
1321344321531 is a wasteful number, since it uses less digits than its factorization.
1321344321531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33880623645.
The product of its digits is 25920, while the sum is 33.
Adding to 1321344321531 its reverse (1351234431231), we get a palindrome (2672578752762).
The spelling of 1321344321531 in words is "one trillion, three hundred twenty-one billion, three hundred forty-four million, three hundred twenty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •