Base | Representation |
---|---|
bin | 110000001011101010001… |
… | …110100011010100001101 |
3 | 102201112102002012010221010 |
4 | 300023222032203110031 |
5 | 413222014423014013 |
6 | 11013024420555433 |
7 | 461134005614631 |
oct | 60135216432415 |
9 | 12645362163833 |
10 | 3311054501133 |
11 | 1067234a46325 |
12 | 455855552b79 |
13 | 1b0300959232 |
14 | b6382254dc1 |
15 | 5b1dc65a7c3 |
hex | 302ea3a350d |
3311054501133 has 8 divisors (see below), whose sum is σ = 4458449625696. Its totient is φ = 2185514522000.
The previous prime is 3311054501129. The next prime is 3311054501141.
3311054501133 is nontrivially palindromic in base 10.
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 3311054501133 - 22 = 3311054501129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3311054501133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3311554501133) 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 7 ways as a sum of consecutive naturals, for example, 5463786003 + ... + 5463786608.
It is an arithmetic number, because the mean of its divisors is an integer number (557306203212).
Almost surely, 23311054501133 is an apocalyptic number.
It is an amenable number.
3311054501133 is a deficient number, since it is larger than the sum of its proper divisors (1147395124563).
3311054501133 is a wasteful number, since it uses less digits than its factorization.
3311054501133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10927572715.
The product of its (nonzero) digits is 8100, while the sum is 30.
The spelling of 3311054501133 in words is "three trillion, three hundred eleven billion, fifty-four million, five hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •