Base | Representation |
---|---|
bin | 110000001100101001010… |
… | …101001101101100101001 |
3 | 102201122010212100020111011 |
4 | 300030221111031230221 |
5 | 413231201440242301 |
6 | 11013321440503521 |
7 | 461202152534053 |
oct | 60145125155451 |
9 | 12648125306434 |
10 | 3312113212201 |
11 | 106772861a652 |
12 | 455ab001aba1 |
13 | 1b043c0b17a1 |
14 | b6442ac68d3 |
15 | 5b250587a51 |
hex | 3032954db29 |
3312113212201 has 16 divisors (see below), whose sum is σ = 3609948447504. Its totient is φ = 3026935701504.
The previous prime is 3312113212193. The next prime is 3312113212207. The reversal of 3312113212201 is 1022123112133.
It can be written as a sum of positive squares in 8 ways, for example, as 192124422400 + 3119988789801 = 438320^2 + 1766349^2 .
It is not a de Polignac number, because 3312113212201 - 23 = 3312113212193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3312113212207) 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 15 ways as a sum of consecutive naturals, for example, 18861270 + ... + 19036063.
It is an arithmetic number, because the mean of its divisors is an integer number (225621777969).
Almost surely, 23312113212201 is an apocalyptic number.
It is an amenable number.
3312113212201 is a deficient number, since it is larger than the sum of its proper divisors (297835235303).
3312113212201 is a wasteful number, since it uses less digits than its factorization.
3312113212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37897500.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 3312113212201 its reverse (1022123112133), we get a palindrome (4334236324334).
The spelling of 3312113212201 in words is "three trillion, three hundred twelve billion, one hundred thirteen million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •