Base | Representation |
---|---|
bin | 10100101011101101010… |
… | …101011111000101011101 |
3 | 12000212200022021212020012 |
4 | 110223231111133011131 |
5 | 141241331141241341 |
6 | 3004540150333005 |
7 | 204454442335115 |
oct | 24535525370535 |
9 | 5025608255205 |
10 | 1421321040221 |
11 | 4a8862745395 |
12 | 1ab56565a165 |
13 | a4050ba54c4 |
14 | 4cb1412c045 |
15 | 26e89d750eb |
hex | 14aed55f15d |
1421321040221 has 8 divisors (see below), whose sum is σ = 1515913039800. Its totient is φ = 1327949582848.
The previous prime is 1421321040199. The next prime is 1421321040263. The reversal of 1421321040221 is 1220401231241.
It can be written as a sum of positive squares in 4 ways, for example, as 837250620196 + 584070420025 = 915014^2 + 764245^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1421321040221 - 210 = 1421321039197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1421321040421) 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, 305133146 + ... + 305137803.
It is an arithmetic number, because the mean of its divisors is an integer number (189489129975).
Almost surely, 21421321040221 is an apocalyptic number.
It is an amenable number.
1421321040221 is a deficient number, since it is larger than the sum of its proper divisors (94591999579).
1421321040221 is a wasteful number, since it uses less digits than its factorization.
1421321040221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 610271103.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1421321040221 its reverse (1220401231241), we get a palindrome (2641722271462).
The spelling of 1421321040221 in words is "one trillion, four hundred twenty-one billion, three hundred twenty-one million, forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •