Base | Representation |
---|---|
bin | 10100110101000000110… |
… | …010111111110100101101 |
3 | 12001211110112120120120011 |
4 | 110311000302333310231 |
5 | 141422311133020023 |
6 | 3013311342453221 |
7 | 205260140426533 |
oct | 24650062776455 |
9 | 5054415516504 |
10 | 1431311220013 |
11 | 502019962324 |
12 | 1b1493294211 |
13 | a4c83834bac |
14 | 4d3c0c56153 |
15 | 27371e4350d |
hex | 14d40cbfd2d |
1431311220013 has 4 divisors (see below), whose sum is σ = 1431340811100. Its totient is φ = 1431281628928.
The previous prime is 1431311219983. The next prime is 1431311220071. The reversal of 1431311220013 is 3100221131341.
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 795812078889 + 635499141124 = 892083^2 + 797182^2 .
It is a cyclic number.
It is not a de Polignac number, because 1431311220013 - 225 = 1431277665581 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 (1431311220413) 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, 14722870 + ... + 14819767.
It is an arithmetic number, because the mean of its divisors is an integer number (357835202775).
Almost surely, 21431311220013 is an apocalyptic number.
It is an amenable number.
1431311220013 is a deficient number, since it is larger than the sum of its proper divisors (29591087).
1431311220013 is an equidigital number, since it uses as much as digits as its factorization.
1431311220013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29591086.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1431311220013 its reverse (3100221131341), we get a palindrome (4531532351354).
The spelling of 1431311220013 in words is "one trillion, four hundred thirty-one billion, three hundred eleven million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •