Base | Representation |
---|---|
bin | 1011000010010000001001… |
… | …0001100100010000101101 |
3 | 1120221221012222121222022011 |
4 | 2300210002101210100231 |
5 | 3042243020104124410 |
6 | 41445545352521221 |
7 | 2361413666610556 |
oct | 260440221442055 |
9 | 46857188558264 |
10 | 12133320770605 |
11 | 3958792295051 |
12 | 143b6286b0211 |
13 | 6a0223569828 |
14 | 2dd38210d32d |
15 | 16093758b18a |
hex | b090246442d |
12133320770605 has 4 divisors (see below), whose sum is σ = 14559984924732. Its totient is φ = 9706656616480.
The previous prime is 12133320770573. The next prime is 12133320770707. The reversal of 12133320770605 is 50607702333121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8939029612041 + 3194291158564 = 2989821^2 + 1787258^2 .
It is not a de Polignac number, because 12133320770605 - 25 = 12133320770573 is a prime.
It is a super-2 number, since 2×121333207706052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1213332077056 + ... + 1213332077065.
It is an arithmetic number, because the mean of its divisors is an integer number (3639996231183).
Almost surely, 212133320770605 is an apocalyptic number.
It is an amenable number.
12133320770605 is a deficient number, since it is larger than the sum of its proper divisors (2426664154127).
12133320770605 is an equidigital number, since it uses as much as digits as its factorization.
12133320770605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2426664154126.
The product of its (nonzero) digits is 158760, while the sum is 40.
The spelling of 12133320770605 in words is "twelve trillion, one hundred thirty-three billion, three hundred twenty million, seven hundred seventy thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •