Base | Representation |
---|---|
bin | 100000001100001111000… |
… | …001010000001011100101 |
3 | 21211110222020120212012221 |
4 | 200030033001100023211 |
5 | 242221000444102401 |
6 | 4412130301112341 |
7 | 315552250655155 |
oct | 40141701201345 |
9 | 7743866525187 |
10 | 2212160144101 |
11 | 783198804256 |
12 | 2b8893b586b1 |
13 | 1307b4c5928b |
14 | 790d7958765 |
15 | 3c823ca77a1 |
hex | 2030f0502e5 |
2212160144101 has 4 divisors (see below), whose sum is σ = 2212267130604. Its totient is φ = 2212053157600.
The previous prime is 2212160144099. The next prime is 2212160144107. The reversal of 2212160144101 is 1014410612122.
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 543803004900 + 1668357139201 = 737430^2 + 1291649^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212160144101 - 21 = 2212160144099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2212160144107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53462230 + ... + 53503591.
It is an arithmetic number, because the mean of its divisors is an integer number (553066782651).
Almost surely, 22212160144101 is an apocalyptic number.
It is an amenable number.
2212160144101 is a deficient number, since it is larger than the sum of its proper divisors (106986503).
2212160144101 is a wasteful number, since it uses less digits than its factorization.
2212160144101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106986502.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 2212160144101 its reverse (1014410612122), we get a palindrome (3226570756223).
The spelling of 2212160144101 in words is "two trillion, two hundred twelve billion, one hundred sixty million, one hundred forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •