Base | Representation |
---|---|
bin | 11101001000110000010… |
… | …00110000110001111111 |
3 | 10112201002122002202101022 |
4 | 32210120020300301333 |
5 | 112400304334030421 |
6 | 2043525220134355 |
7 | 132220664254004 |
oct | 16443010606177 |
9 | 3481078082338 |
10 | 1001132330111 |
11 | 35663a112301 |
12 | 1420392373bb |
13 | 73538a58c64 |
14 | 3665299d8ab |
15 | 1b095d867ab |
hex | e918230c7f |
1001132330111 has 12 divisors (see below), whose sum is σ = 1059972553152. Its totient is φ = 945410884704.
The previous prime is 1001132330101. The next prime is 1001132330113. The reversal of 1001132330111 is 1110332311001.
It is not a de Polignac number, because 1001132330111 - 222 = 1001128135807 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1001132330111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001132330113) 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 11 ways as a sum of consecutive naturals, for example, 4317071 + ... + 4543056.
It is an arithmetic number, because the mean of its divisors is an integer number (88331046096).
Almost surely, 21001132330111 is an apocalyptic number.
1001132330111 is a deficient number, since it is larger than the sum of its proper divisors (58840223041).
1001132330111 is an equidigital number, since it uses as much as digits as its factorization.
1001132330111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8860478 (or 8860459 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1001132330111 its reverse (1110332311001), we get a palindrome (2111464641112).
The spelling of 1001132330111 in words is "one trillion, one billion, one hundred thirty-two million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •