Base | Representation |
---|---|
bin | 110000011101100110000… |
… | …000010001010011011111 |
3 | 102210101010002200201011102 |
4 | 300131212000101103133 |
5 | 414030434104020221 |
6 | 11025531310343315 |
7 | 462415132304600 |
oct | 60354600212337 |
9 | 12711102621142 |
10 | 3330311001311 |
11 | 1074416814988 |
12 | 45952a4bab3b |
13 | 1b207c2a3c38 |
14 | b728b8bbda7 |
15 | 5b967eb030b |
hex | 307660114df |
3330311001311 has 12 divisors (see below), whose sum is σ = 3874103155368. Its totient is φ = 2854502248752.
The previous prime is 3330311001299. The next prime is 3330311001341. The reversal of 3330311001311 is 1131001130333.
It is not a de Polignac number, because 3330311001311 - 214 = 3330310984927 is a prime.
It is a super-2 number, since 2×33303110013112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3330311001341) 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 11 ways as a sum of consecutive naturals, for example, 2378120 + ... + 3509426.
It is an arithmetic number, because the mean of its divisors is an integer number (322841929614).
Almost surely, 23330311001311 is an apocalyptic number.
3330311001311 is a deficient number, since it is larger than the sum of its proper divisors (543792154057).
3330311001311 is a wasteful number, since it uses less digits than its factorization.
3330311001311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191398 (or 1191391 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 3330311001311 its reverse (1131001130333), we get a palindrome (4461312131644).
The spelling of 3330311001311 in words is "three trillion, three hundred thirty billion, three hundred eleven million, one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •