Base | Representation |
---|---|
bin | 11101001000111010001… |
… | …101101111010101011101 |
3 | 21002102121220000210220121 |
4 | 131020322031233111131 |
5 | 230301434422041341 |
6 | 4131523155114541 |
7 | 264446055256042 |
oct | 35107215572535 |
9 | 7072556023817 |
10 | 2002431440221 |
11 | 702254387913 |
12 | 2841022a2a51 |
13 | 116aa020a6b4 |
14 | 6ccbd7751c9 |
15 | 3714b6b44d1 |
hex | 1d23a36f55d |
2002431440221 has 8 divisors (see below), whose sum is σ = 2007239657720. Its totient is φ = 1997625086208.
The previous prime is 2002431440201. The next prime is 2002431440231. The reversal of 2002431440221 is 1220441342002.
It can be written as a sum of positive squares in 4 ways, for example, as 99342214596 + 1903089225625 = 315186^2 + 1379525^2 .
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 2002431440221 - 233 = 1993841505629 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 (2002431440201) 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, 1697875 + ... + 2624431.
It is an arithmetic number, because the mean of its divisors is an integer number (250904957215).
Almost surely, 22002431440221 is an apocalyptic number.
It is an amenable number.
2002431440221 is a deficient number, since it is larger than the sum of its proper divisors (4808217499).
2002431440221 is an equidigital number, since it uses as much as digits as its factorization.
2002431440221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 931743.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 2002431440221 its reverse (1220441342002), we get a palindrome (3222872782223).
The spelling of 2002431440221 in words is "two trillion, two billion, four hundred thirty-one million, four hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •