Base | Representation |
---|---|
bin | 110000001101110001011… |
… | …001010000110100101101 |
3 | 102201202021010022212102012 |
4 | 300031301121100310231 |
5 | 413241140442430013 |
6 | 11014041430211005 |
7 | 461244133203323 |
oct | 60156131206455 |
9 | 12652233285365 |
10 | 3313322233133 |
11 | 1068199027a00 |
12 | 456188ab3a65 |
13 | 1b05a2713ca3 |
14 | b65194c3d13 |
15 | 5b2c17a61a8 |
hex | 30371650d2d |
3313322233133 has 12 divisors (see below), whose sum is σ = 3643452514464. Its totient is φ = 3010840463400.
The previous prime is 3313322233087. The next prime is 3313322233139.
It is a happy number.
3313322233133 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 3313322233133 - 28 = 3313322232877 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3313322233133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3313322233139) 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, 5487641 + ... + 6061422.
It is an arithmetic number, because the mean of its divisors is an integer number (303621042872).
Almost surely, 23313322233133 is an apocalyptic number.
It is an amenable number.
3313322233133 is a deficient number, since it is larger than the sum of its proper divisors (330130281331).
3313322233133 is a wasteful number, since it uses less digits than its factorization.
3313322233133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11551456 (or 11551445 counting only the distinct ones).
The product of its digits is 52488, while the sum is 32.
The spelling of 3313322233133 in words is "three trillion, three hundred thirteen billion, three hundred twenty-two million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •