Base | Representation |
---|---|
bin | 11111000000000000011… |
… | …100000000110100010001 |
3 | 21112122201001012202000002 |
4 | 133000000130000310101 |
5 | 234400334121402233 |
6 | 4310352412335345 |
7 | 306624044524142 |
oct | 37000034006421 |
9 | 7478631182002 |
10 | 2130311122193 |
11 | 7515071006a1 |
12 | 2a4a50a74555 |
13 | 125b6ca2c277 |
14 | 751713c5ac9 |
15 | 3a6332ea6e8 |
hex | 1f000700d11 |
2130311122193 has 8 divisors (see below), whose sum is σ = 2136137731560. Its totient is φ = 2124490950400.
The previous prime is 2130311122187. The next prime is 2130311122231. The reversal of 2130311122193 is 3912211130312.
It can be written as a sum of positive squares in 4 ways, for example, as 347466628369 + 1782844493824 = 589463^2 + 1335232^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 2130311122193 - 26 = 2130311122129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2130311122183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 946280 + ... + 2270697.
It is an arithmetic number, because the mean of its divisors is an integer number (267017216445).
Almost surely, 22130311122193 is an apocalyptic number.
It is an amenable number.
2130311122193 is a deficient number, since it is larger than the sum of its proper divisors (5826609367).
2130311122193 is a wasteful number, since it uses less digits than its factorization.
2130311122193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3218787.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 2130311122193 in words is "two trillion, one hundred thirty billion, three hundred eleven million, one hundred twenty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •