Base | Representation |
---|---|
bin | 1010000111110111100110… |
… | …0101010111001011010011 |
3 | 1110102001020202021122120100 |
4 | 2201331321211113023103 |
5 | 2424324323311220311 |
6 | 35401104514543443 |
7 | 2226065132601555 |
oct | 241757145271323 |
9 | 43361222248510 |
10 | 11130300101331 |
11 | 3601374271674 |
12 | 12b9162b97b83 |
13 | 629776530828 |
14 | 2a69d083d4d5 |
15 | 1447d0a4ba56 |
hex | a1f799572d3 |
11130300101331 has 12 divisors (see below), whose sum is σ = 16419166107552. Its totient is φ = 7262323470096.
The previous prime is 11130300101287. The next prime is 11130300101369. The reversal of 11130300101331 is 13310100303111.
11130300101331 is a `hidden beast` number, since 1 + 1 + 1 + 30 + 300 + 1 + 0 + 1 + 331 = 666.
It is not a de Polignac number, because 11130300101331 - 26 = 11130300101267 is a prime.
It is a super-2 number, since 2×111303001013312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11130300102331) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13156382676 + ... + 13156383521.
It is an arithmetic number, because the mean of its divisors is an integer number (1368263842296).
Almost surely, 211130300101331 is an apocalyptic number.
11130300101331 is a deficient number, since it is larger than the sum of its proper divisors (5288866006221).
11130300101331 is a wasteful number, since it uses less digits than its factorization.
11130300101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26312766250 (or 26312766247 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 11130300101331 its reverse (13310100303111), we get a palindrome (24440400404442).
The spelling of 11130300101331 in words is "eleven trillion, one hundred thirty billion, three hundred million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •