Base | Representation |
---|---|
bin | 101111111110100010… |
… | …0011000101110011111 |
3 | 100211221100011222112200 |
4 | 1133331010120232133 |
5 | 3142001142031221 |
6 | 115155323102543 |
7 | 10305115555602 |
oct | 1377504305637 |
9 | 324840158480 |
10 | 103030033311 |
11 | 3a770849a67 |
12 | 17b74671a53 |
13 | 993c4ab16a |
14 | 4db5644339 |
15 | 2a30262426 |
hex | 17fd118b9f |
103030033311 has 12 divisors (see below), whose sum is σ = 148828692480. Its totient is φ = 68683212000.
The previous prime is 103030033307. The next prime is 103030033313. The reversal of 103030033311 is 113330030301.
103030033311 is a `hidden beast` number, since 1 + 0 + 30 + 300 + 3 + 331 + 1 = 666.
It is not a de Polignac number, because 103030033311 - 22 = 103030033307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103030033313) 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 11 ways as a sum of consecutive naturals, for example, 95190 + ... + 463811.
It is an arithmetic number, because the mean of its divisors is an integer number (12402391040).
Almost surely, 2103030033311 is an apocalyptic number.
103030033311 is a deficient number, since it is larger than the sum of its proper divisors (45798659169).
103030033311 is a wasteful number, since it uses less digits than its factorization.
103030033311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579486 (or 579483 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 18.
Adding to 103030033311 its reverse (113330030301), we get a palindrome (216360063612).
It can be divided in two parts, 1030300 and 33311, that added together give a triangular number (1063611 = T1458).
The spelling of 103030033311 in words is "one hundred three billion, thirty million, thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •