Base | Representation |
---|---|
bin | 10100101110010101011… |
… | …100000010101101110001 |
3 | 12001010221212011111021211 |
4 | 110232111130002231301 |
5 | 141313120140100223 |
6 | 3010124055120121 |
7 | 204614356404121 |
oct | 24562534025561 |
9 | 5033855144254 |
10 | 1424141331313 |
11 | 4a9a7a721878 |
12 | 1b0012073041 |
13 | a43b02884bc |
14 | 4cd00914c81 |
15 | 270a276bd0d |
hex | 14b95702b71 |
1424141331313 has 8 divisors (see below), whose sum is σ = 1507963736520. Its totient is φ = 1340324413440.
The previous prime is 1424141331311. The next prime is 1424141331323. The reversal of 1424141331313 is 3131331414241.
It can be written as a sum of positive squares in 4 ways, for example, as 319555045264 + 1104586286049 = 565292^2 + 1050993^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 1424141331313 - 21 = 1424141331311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1424141331311) 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, 831408 + ... + 1881361.
It is an arithmetic number, because the mean of its divisors is an integer number (188495467065).
Almost surely, 21424141331313 is an apocalyptic number.
It is an amenable number.
1424141331313 is a deficient number, since it is larger than the sum of its proper divisors (83822405207).
1424141331313 is a wasteful number, since it uses less digits than its factorization.
1424141331313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2743667.
The product of its digits is 10368, while the sum is 31.
Adding to 1424141331313 its reverse (3131331414241), we get a palindrome (4555472745554).
The spelling of 1424141331313 in words is "one trillion, four hundred twenty-four billion, one hundred forty-one million, three hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •