Base | Representation |
---|---|
bin | 10100110100110100111… |
… | …000011000001101001011 |
3 | 12001210221121101210100210 |
4 | 110310310320120031023 |
5 | 141421403443212021 |
6 | 3013235441532203 |
7 | 205252162242204 |
oct | 24646470301513 |
9 | 5053847353323 |
10 | 1431111304011 |
11 | 501a27027494 |
12 | 1b1438344063 |
13 | a4c512a9bbc |
14 | 4d3a24965ab |
15 | 2735e603e76 |
hex | 14d34e1834b |
1431111304011 has 8 divisors (see below), whose sum is σ = 2020392429264. Its totient is φ = 897952190720.
The previous prime is 1431111304009. The next prime is 1431111304027. The reversal of 1431111304011 is 1104031111341.
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 1431111304011 - 21 = 1431111304009 is a prime.
It is a super-3 number, since 3×14311113040113 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1431111305011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14030502930 + ... + 14030503031.
It is an arithmetic number, because the mean of its divisors is an integer number (252549053658).
Almost surely, 21431111304011 is an apocalyptic number.
1431111304011 is a deficient number, since it is larger than the sum of its proper divisors (589281125253).
1431111304011 is a wasteful number, since it uses less digits than its factorization.
1431111304011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28061005981.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 1431111304011 its reverse (1104031111341), we get a palindrome (2535142415352).
The spelling of 1431111304011 in words is "one trillion, four hundred thirty-one billion, one hundred eleven million, three hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •