Base | Representation |
---|---|
bin | 10011011000000001011… |
… | …110100001101100110011 |
3 | 11201021202001121211210111 |
4 | 103120001132201230303 |
5 | 133303314422010311 |
6 | 2455355540042151 |
7 | 165123635500516 |
oct | 23300136415463 |
9 | 4637661554714 |
10 | 1331464641331 |
11 | 473742095a00 |
12 | 196068993357 |
13 | 98730a516c6 |
14 | 4862c330d7d |
15 | 2497b411d21 |
hex | 136017a1b33 |
1331464641331 has 48 divisors (see below), whose sum is σ = 1578300998400. Its totient is φ = 1119777120000.
The previous prime is 1331464641293. The next prime is 1331464641343.
1331464641331 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1331464641331 - 225 = 1331431086899 is a prime.
It is a super-2 number, since 2×13314646413312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1331464645331) 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 47 ways as a sum of consecutive naturals, for example, 10926085 + ... + 11047273.
It is an arithmetic number, because the mean of its divisors is an integer number (32881270800).
Almost surely, 21331464641331 is an apocalyptic number.
1331464641331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1331464641331 is a deficient number, since it is larger than the sum of its proper divisors (246836357069).
1331464641331 is a wasteful number, since it uses less digits than its factorization.
1331464641331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121372 (or 121361 counting only the distinct ones).
The product of its digits is 186624, while the sum is 40.
The spelling of 1331464641331 in words is "one trillion, three hundred thirty-one billion, four hundred sixty-four million, six hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •