Base | Representation |
---|---|
bin | 110000001101011111011… |
… | …100010001011001001101 |
3 | 102201201111010120021011011 |
4 | 300031133130101121031 |
5 | 413240031341011023 |
6 | 11013551510325221 |
7 | 461233515062050 |
oct | 60153734213115 |
9 | 12651433507134 |
10 | 3313021032013 |
11 | 1068054003060 |
12 | 456104059811 |
13 | 1b05551b5584 |
14 | b64cb4baa97 |
15 | 5b2a510b50d |
hex | 3035f71164d |
3313021032013 has 16 divisors (see below), whose sum is σ = 4134721775616. Its totient is φ = 2578948550640.
The previous prime is 3313021032011. The next prime is 3313021032049. The reversal of 3313021032013 is 3102301203133.
3313021032013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3313021032013 - 21 = 3313021032011 is a prime.
It is a super-2 number, since 2×33130210320132 (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 (3313021032011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21809481 + ... + 21960862.
It is an arithmetic number, because the mean of its divisors is an integer number (258420110976).
Almost surely, 23313021032013 is an apocalyptic number.
It is an amenable number.
3313021032013 is a deficient number, since it is larger than the sum of its proper divisors (821700743603).
3313021032013 is a wasteful number, since it uses less digits than its factorization.
3313021032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43771344.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3313021032013 its reverse (3102301203133), we get a palindrome (6415322235146).
The spelling of 3313021032013 in words is "three trillion, three hundred thirteen billion, twenty-one million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •