Base | Representation |
---|---|
bin | 10100110101000001111… |
… | …111001110101110110101 |
3 | 12001211111221011212110121 |
4 | 110311001333032232311 |
5 | 141422331242012041 |
6 | 3013313335051541 |
7 | 205260502331125 |
oct | 24650177165665 |
9 | 5054457155417 |
10 | 1431331204021 |
11 | 50202a171634 |
12 | 1b1499b10bb1 |
13 | a4c87a10c54 |
14 | 4d3c3778c85 |
15 | 27373a8e7d1 |
hex | 14d41fcebb5 |
1431331204021 has 4 divisors (see below), whose sum is σ = 1431528990892. Its totient is φ = 1431133417152.
The previous prime is 1431331204019. The next prime is 1431331204097. The reversal of 1431331204021 is 1204021331341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1291166327025 + 140164876996 = 1136295^2 + 374386^2 .
It is a cyclic number.
It is not a de Polignac number, because 1431331204021 - 21 = 1431331204019 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 (1431331204001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98882580 + ... + 98897053.
It is an arithmetic number, because the mean of its divisors is an integer number (357882247723).
Almost surely, 21431331204021 is an apocalyptic number.
It is an amenable number.
1431331204021 is a deficient number, since it is larger than the sum of its proper divisors (197786871).
1431331204021 is an equidigital number, since it uses as much as digits as its factorization.
1431331204021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197786870.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1431331204021 its reverse (1204021331341), we get a palindrome (2635352535362).
The spelling of 1431331204021 in words is "one trillion, four hundred thirty-one billion, three hundred thirty-one million, two hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •