Base | Representation |
---|---|
bin | 10100110101000000110… |
… | …010111111110100110101 |
3 | 12001211110112120120120110 |
4 | 110311000302333310311 |
5 | 141422311133020041 |
6 | 3013311342453233 |
7 | 205260140426544 |
oct | 24650062776465 |
9 | 5054415516513 |
10 | 1431311220021 |
11 | 502019962331 |
12 | 1b1493294219 |
13 | a4c83834bb7 |
14 | 4d3c0c5615b |
15 | 27371e43516 |
hex | 14d40cbfd35 |
1431311220021 has 8 divisors (see below), whose sum is σ = 1939700451424. Its totient is φ = 938564734320.
The previous prime is 1431311219983. The next prime is 1431311220071. The reversal of 1431311220021 is 1200221131341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1431311220021 - 237 = 1293872266549 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 1431311220021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1431311220071) 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, 3910686211 + ... + 3910686576.
It is an arithmetic number, because the mean of its divisors is an integer number (242462556428).
Almost surely, 21431311220021 is an apocalyptic number.
It is an amenable number.
1431311220021 is a deficient number, since it is larger than the sum of its proper divisors (508389231403).
1431311220021 is an equidigital number, since it uses as much as digits as its factorization.
1431311220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7821372851.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1431311220021 its reverse (1200221131341), we get a palindrome (2631532351362).
The spelling of 1431311220021 in words is "one trillion, four hundred thirty-one billion, three hundred eleven million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •