Base | Representation |
---|---|
bin | 110000000001110001101… |
… | …000011110101010101111 |
3 | 102200112000102121200120112 |
4 | 300001301220132222233 |
5 | 413033300434220421 |
6 | 11004111331410235 |
7 | 460310004225125 |
oct | 60016150365257 |
9 | 12615012550515 |
10 | 3300441320111 |
11 | 10627890a0341 |
12 | 45379315397b |
13 | 1ac2cbc09770 |
14 | b5a568b7915 |
15 | 5acbaa2945b |
hex | 30071a1eaaf |
3300441320111 has 4 divisors (see below), whose sum is σ = 3554321421672. Its totient is φ = 3046561218552.
The previous prime is 3300441320093. The next prime is 3300441320129. The reversal of 3300441320111 is 1110231440033.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (3300441320093) and next prime (3300441320129).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3300441320111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3300441320161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126940050761 + ... + 126940050786.
It is an arithmetic number, because the mean of its divisors is an integer number (888580355418).
Almost surely, 23300441320111 is an apocalyptic number.
3300441320111 is a deficient number, since it is larger than the sum of its proper divisors (253880101561).
3300441320111 is a wasteful number, since it uses less digits than its factorization.
3300441320111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253880101560.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 3300441320111 its reverse (1110231440033), we get a palindrome (4410672760144).
The spelling of 3300441320111 in words is "three trillion, three hundred billion, four hundred forty-one million, three hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •