Base | Representation |
---|---|
bin | 110000001100011111111… |
… | …101110110100011000001 |
3 | 102201121201220200202121222 |
4 | 300030133331312203001 |
5 | 413230341224434441 |
6 | 11013254105124425 |
7 | 461165234203664 |
oct | 60143775664301 |
9 | 12647656622558 |
10 | 3311956093121 |
11 | 1067657965775 |
12 | 455a67489715 |
13 | 1b041568c410 |
14 | b6429ca76db |
15 | 5b24189dd4b |
hex | 3031ff768c1 |
3311956093121 has 8 divisors (see below), whose sum is σ = 3566765387304. Its totient is φ = 3057153004800.
The previous prime is 3311956093057. The next prime is 3311956093189. The reversal of 3311956093121 is 1213906591133.
It can be written as a sum of positive squares in 4 ways, for example, as 264962415025 + 3046993678096 = 514745^2 + 1745564^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3311956093121 - 26 = 3311956093057 is a prime.
It is a super-2 number, since 2×33119560931212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3311956096121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 412046 + ... + 2606471.
It is an arithmetic number, because the mean of its divisors is an integer number (445845673413).
Almost surely, 23311956093121 is an apocalyptic number.
It is an amenable number.
3311956093121 is a deficient number, since it is larger than the sum of its proper divisors (254809294183).
3311956093121 is a wasteful number, since it uses less digits than its factorization.
3311956093121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3102931.
The product of its (nonzero) digits is 131220, while the sum is 44.
The spelling of 3311956093121 in words is "three trillion, three hundred eleven billion, nine hundred fifty-six million, ninety-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •