Base | Representation |
---|---|
bin | 11110111000010111100… |
… | …111010011001001000011 |
3 | 21111212112111101200210022 |
4 | 132320113213103021003 |
5 | 234232040131202321 |
6 | 4302514530324055 |
7 | 306213602365514 |
oct | 36702747231103 |
9 | 7455474350708 |
10 | 2122110022211 |
11 | 748a88869913 |
12 | 2a334242962b |
13 | 12516393829a |
14 | 749d4130a0b |
15 | 3a303329dab |
hex | 1ee179d3243 |
2122110022211 has 8 divisors (see below), whose sum is σ = 2233913882880. Its totient is φ = 2010317547528.
The previous prime is 2122110022199. The next prime is 2122110022231. The reversal of 2122110022211 is 1122200112212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2122110022211 - 26 = 2122110022147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2122110022211.
It is not an unprimeable number, because it can be changed into a prime (2122110022231) 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, 2462591 + ... + 3210696.
It is an arithmetic number, because the mean of its divisors is an integer number (279239235360).
Almost surely, 22122110022211 is an apocalyptic number.
2122110022211 is a deficient number, since it is larger than the sum of its proper divisors (111803860669).
2122110022211 is a wasteful number, since it uses less digits than its factorization.
2122110022211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5692993.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 2122110022211 its reverse (1122200112212), we get a palindrome (3244310134423).
Subtracting from 2122110022211 its reverse (1122200112212), we obtain a palindrome (999909909999).
The spelling of 2122110022211 in words is "two trillion, one hundred twenty-two billion, one hundred ten million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •