Base | Representation |
---|---|
bin | 10011010111101011110… |
… | …100100010000000011001 |
3 | 11201020210201221202021121 |
4 | 103113223310202000121 |
5 | 133302043413423001 |
6 | 2455255520405241 |
7 | 165111634313440 |
oct | 23275364420031 |
9 | 4636721852247 |
10 | 1331101311001 |
11 | 473575a96500 |
12 | 195b87176821 |
13 | 986a36abb47 |
14 | 485d5d93d57 |
15 | 249595936a1 |
hex | 135ebd22019 |
1331101311001 has 24 divisors (see below), whose sum is σ = 1688683090752. Its totient is φ = 1026952212000.
The previous prime is 1331101310951. The next prime is 1331101311013. The reversal of 1331101311001 is 1001131011331.
It is not a de Polignac number, because 1331101311001 - 27 = 1331101310873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1331101311031) 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 23 ways as a sum of consecutive naturals, for example, 7694395 + ... + 7865488.
It is an arithmetic number, because the mean of its divisors is an integer number (70361795448).
Almost surely, 21331101311001 is an apocalyptic number.
1331101311001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1331101311001 is a deficient number, since it is larger than the sum of its proper divisors (357581779751).
1331101311001 is a wasteful number, since it uses less digits than its factorization.
1331101311001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15560013 (or 15560002 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1331101311001 its reverse (1001131011331), we get a palindrome (2332232322332).
The spelling of 1331101311001 in words is "one trillion, three hundred thirty-one billion, one hundred one million, three hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •