Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101011001001111011 |
3 | 1111010020122000122202211121 |
4 | 2210320330003223021323 |
5 | 2441122124104314003 |
6 | 40033241101010111 |
7 | 2246434666036432 |
oct | 244707403531173 |
9 | 44106560582747 |
10 | 11331131323003 |
11 | 3679562258a28 |
12 | 1330070b53937 |
13 | 6426a0b1493b |
14 | 2b2603096119 |
15 | 149b36e63cbd |
hex | a4e3c0eb27b |
11331131323003 has 8 divisors (see below), whose sum is σ = 11347223418000. Its totient is φ = 11315041280928.
The previous prime is 11331131322997. The next prime is 11331131323037. The reversal of 11331131323003 is 30032313113311.
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 11331131323003 - 217 = 11331131191931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11331131323093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10707573 + ... + 11718121.
It is an arithmetic number, because the mean of its divisors is an integer number (1418402927250).
Almost surely, 211331131323003 is an apocalyptic number.
11331131323003 is a deficient number, since it is larger than the sum of its proper divisors (16092094997).
11331131323003 is a wasteful number, since it uses less digits than its factorization.
11331131323003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026461.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 11331131323003 its reverse (30032313113311), we get a palindrome (41363444436314).
The spelling of 11331131323003 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred twenty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •