Base | Representation |
---|---|
bin | 10011010111100110101… |
… | …111100100111110000101 |
3 | 11201020120210122220220012 |
4 | 103113212233210332011 |
5 | 133301410112020331 |
6 | 2455243234520005 |
7 | 165106551254606 |
oct | 23274657447605 |
9 | 4636523586805 |
10 | 1331016126341 |
11 | 4735319a3a60 |
12 | 195b62736005 |
13 | 9868bb54915 |
14 | 485c893bdad |
15 | 24951d6882b |
hex | 135e6be4f85 |
1331016126341 has 8 divisors (see below), whose sum is σ = 1452043454400. Its totient is φ = 1209993108640.
The previous prime is 1331016126313. The next prime is 1331016126353. The reversal of 1331016126341 is 1436216101331.
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 1331016126341 - 222 = 1331011932037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1331016126298 and 1331016126307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331016126541) 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, 414161 + ... + 1683318.
It is an arithmetic number, because the mean of its divisors is an integer number (181505431800).
Almost surely, 21331016126341 is an apocalyptic number.
1331016126341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1331016126341 is a deficient number, since it is larger than the sum of its proper divisors (121027328059).
1331016126341 is a wasteful number, since it uses less digits than its factorization.
1331016126341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2155179.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 1331016126341 in words is "one trillion, three hundred thirty-one billion, sixteen million, one hundred twenty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •