Base | Representation |
---|---|
bin | 11110101111000100011… |
… | …011000010111101000101 |
3 | 21110220202120121211112212 |
4 | 132233010123002331011 |
5 | 234101112314213121 |
6 | 4254144015153205 |
7 | 305411260616231 |
oct | 36570433027505 |
9 | 7426676554485 |
10 | 2112124366661 |
11 | 744824162021 |
12 | 2a1416215805 |
13 | 124231c00c6a |
14 | 74327c635c1 |
15 | 39e1b85225b |
hex | 1ebc46c2f45 |
2112124366661 has 8 divisors (see below), whose sum is σ = 2147946070560. Its totient is φ = 2076303429072.
The previous prime is 2112124366657. The next prime is 2112124366663. The reversal of 2112124366661 is 1666634212112.
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 2112124366661 - 22 = 2112124366657 is a prime.
It is a super-2 number, since 2×21121243666612 (a number of 25 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 (2112124366663) 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, 9428591 + ... + 9650003.
It is an arithmetic number, because the mean of its divisors is an integer number (268493258820).
Almost surely, 22112124366661 is an apocalyptic number.
It is an amenable number.
2112124366661 is a deficient number, since it is larger than the sum of its proper divisors (35821703899).
2112124366661 is a wasteful number, since it uses less digits than its factorization.
2112124366661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 383155.
The product of its digits is 124416, while the sum is 41.
Adding to 2112124366661 its reverse (1666634212112), we get a palindrome (3778758578773).
The spelling of 2112124366661 in words is "two trillion, one hundred twelve billion, one hundred twenty-four million, three hundred sixty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •