Base | Representation |
---|---|
bin | 10011001110010100001… |
… | …011111100111011111101 |
3 | 11200021211121221011000201 |
4 | 103032110023330323331 |
5 | 133120443011333041 |
6 | 2450513343523501 |
7 | 164304426153466 |
oct | 23162413747375 |
9 | 4607747834021 |
10 | 1321041121021 |
11 | 46a283300906 |
12 | 194039bb9591 |
13 | 9775c3a90cb |
14 | 47d1dc43d6d |
15 | 2456b296631 |
hex | 133942fcefd |
1321041121021 has 8 divisors (see below), whose sum is σ = 1325669925888. Its totient is φ = 1316419950000.
The previous prime is 1321041120983. The next prime is 1321041121039. The reversal of 1321041121021 is 1201211401231.
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 1321041121021 - 221 = 1321039023869 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1321041121021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321041121051) 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, 1561645 + ... + 2254066.
It is an arithmetic number, because the mean of its divisors is an integer number (165708740736).
Almost surely, 21321041121021 is an apocalyptic number.
It is an amenable number.
1321041121021 is a deficient number, since it is larger than the sum of its proper divisors (4628804867).
1321041121021 is an equidigital number, since it uses as much as digits as its factorization.
1321041121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3816923.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1321041121021 its reverse (1201211401231), we get a palindrome (2522252522252).
The spelling of 1321041121021 in words is "one trillion, three hundred twenty-one billion, forty-one million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •