Base | Representation |
---|---|
bin | 100000110101111… |
… | …1101000011110101 |
3 | 2211210200111111200 |
4 | 1001223331003311 |
5 | 4224110310313 |
6 | 301204323113 |
7 | 36211124331 |
oct | 10153750365 |
9 | 2753614450 |
10 | 1102041333 |
11 | 516089a68 |
12 | 2690a3499 |
13 | 147416b83 |
14 | a65107c1 |
15 | 66b3ab73 |
hex | 41afd0f5 |
1102041333 has 12 divisors (see below), whose sum is σ = 1595326668. Its totient is φ = 733083840.
The previous prime is 1102041331. The next prime is 1102041341. The reversal of 1102041333 is 3331402011.
It can be written as a sum of positive squares in 2 ways, for example, as 404130609 + 697910724 = 20103^2 + 26418^2 .
It is not a de Polignac number, because 1102041333 - 21 = 1102041331 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102041331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 129858 + ... + 138083.
It is an arithmetic number, because the mean of its divisors is an integer number (132943889).
Almost surely, 21102041333 is an apocalyptic number.
It is an amenable number.
1102041333 is a deficient number, since it is larger than the sum of its proper divisors (493285335).
1102041333 is a wasteful number, since it uses less digits than its factorization.
1102041333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268404 (or 268401 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1102041333 is about 33197.0078922785. The cubic root of 1102041333 is about 1032.9182746401.
Adding to 1102041333 its reverse (3331402011), we get a palindrome (4433443344).
The spelling of 1102041333 in words is "one billion, one hundred two million, forty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •