Base | Representation |
---|---|
bin | 10011001110011111000… |
… | …010100010110010100001 |
3 | 11200022022022112220220210 |
4 | 103032133002202302201 |
5 | 133121331120012001 |
6 | 2450543410324333 |
7 | 164312066635611 |
oct | 23163702426241 |
9 | 4608268486823 |
10 | 1321223204001 |
11 | 46a367066508 |
12 | 19408ab896a9 |
13 | 9778b02c10c |
14 | 47d3a0c0a41 |
15 | 2457c261dd6 |
hex | 1339f0a2ca1 |
1321223204001 has 4 divisors (see below), whose sum is σ = 1761630938672. Its totient is φ = 880815469332.
The previous prime is 1321223203987. The next prime is 1321223204023. The reversal of 1321223204001 is 1004023221231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1321223204001 - 210 = 1321223202977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1321223202001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220203867331 + ... + 220203867336.
It is an arithmetic number, because the mean of its divisors is an integer number (440407734668).
Almost surely, 21321223204001 is an apocalyptic number.
It is an amenable number.
1321223204001 is a deficient number, since it is larger than the sum of its proper divisors (440407734671).
1321223204001 is an equidigital number, since it uses as much as digits as its factorization.
1321223204001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440407734670.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1321223204001 its reverse (1004023221231), we get a palindrome (2325246425232).
The spelling of 1321223204001 in words is "one trillion, three hundred twenty-one billion, two hundred twenty-three million, two hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •