Base | Representation |
---|---|
bin | 100000001010010101000… |
… | …100010000001010101010 |
3 | 21211021200122121120020200 |
4 | 200022111010100022222 |
5 | 242202303203010442 |
6 | 4411151251333030 |
7 | 315450454654422 |
oct | 40122504201252 |
9 | 7737618546220 |
10 | 2210114110122 |
11 | 782338885686 |
12 | 2b84028b1176 |
13 | 13054a0b4a99 |
14 | 78d81d19482 |
15 | 3c75435034c |
hex | 202951102aa |
2210114110122 has 24 divisors (see below), whose sum is σ = 4835992264740. Its totient is φ = 729410596800.
The previous prime is 2210114110117. The next prime is 2210114110157.
2210114110122 is a `hidden beast` number, since 221 + 0 + 11 + 411 + 0 + 1 + 22 = 666.
2210114110122 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 2204752795281 + 5361314841 = 1484841^2 + 73221^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2210114110095 and 2210114110104.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 607840347 + ... + 607843982.
Almost surely, 22210114110122 is an apocalyptic number.
2210114110122 is an abundant number, since it is smaller than the sum of its proper divisors (2625878154618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2210114110122 is a wasteful number, since it uses less digits than its factorization.
2210114110122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1215684438 (or 1215684435 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
The spelling of 2210114110122 in words is "two trillion, two hundred ten billion, one hundred fourteen million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •