Base | Representation |
---|---|
bin | 100000001010010101100… |
… | …010011001001001000000 |
3 | 21211021201012110222111012 |
4 | 200022111202121021000 |
5 | 242202312213324300 |
6 | 4411152132540052 |
7 | 315450612062555 |
oct | 40122542311100 |
9 | 7737635428435 |
10 | 2210122011200 |
11 | 7823422918a4 |
12 | 2b8405481628 |
13 | 13054b92018c |
14 | 78d82db4a2c |
15 | 3c754db1435 |
hex | 20295899240 |
2210122011200 has 42 divisors (see below), whose sum is σ = 5438281477746. Its totient is φ = 884048803840.
The previous prime is 2210122011199. The next prime is 2210122011203. The reversal of 2210122011200 is 21102210122.
It can be written as a sum of positive squares in 3 ways, for example, as 41759739904 + 2168362271296 = 204352^2 + 1472536^2 .
It is not an unprimeable number, because it can be changed into a prime (2210122011203) 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 5 ways as a sum of consecutive naturals, for example, 690661529 + ... + 690664728.
Almost surely, 22210122011200 is an apocalyptic number.
2210122011200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2210122011200 is an abundant number, since it is smaller than the sum of its proper divisors (3228159466546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2210122011200 is a wasteful number, since it uses less digits than its factorization.
2210122011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1381326279 (or 1381326264 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2210122011200 its reverse (21102210122), we get a palindrome (2231224221322).
The spelling of 2210122011200 in words is "two trillion, two hundred ten billion, one hundred twenty-two million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •