Base | Representation |
---|---|
bin | 11110111100100001011… |
… | …111001000110010111101 |
3 | 21112022001100210122120010 |
4 | 132330201133020302331 |
5 | 234320204034402031 |
6 | 4304533312413433 |
7 | 306432255020160 |
oct | 36744137106275 |
9 | 7468040718503 |
10 | 2126570622141 |
11 | 74a967749639 |
12 | 2a4188247279 |
13 | 1256c4ac8324 |
14 | 74cd8701ad7 |
15 | 3a4b4c34246 |
hex | 1ef217c8cbd |
2126570622141 has 32 divisors (see below), whose sum is σ = 3381776087040. Its totient is φ = 1162212790464.
The previous prime is 2126570622139. The next prime is 2126570622161. The reversal of 2126570622141 is 1412260756212.
It is not a de Polignac number, because 2126570622141 - 21 = 2126570622139 is a prime.
It is a super-2 number, since 2×21265706221412 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2126570622141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2126570622131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3933186 + ... + 4441068.
It is an arithmetic number, because the mean of its divisors is an integer number (105680502720).
Almost surely, 22126570622141 is an apocalyptic number.
2126570622141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2126570622141 is a deficient number, since it is larger than the sum of its proper divisors (1255205464899).
2126570622141 is a wasteful number, since it uses less digits than its factorization.
2126570622141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 516585.
The product of its (nonzero) digits is 80640, while the sum is 39.
The spelling of 2126570622141 in words is "two trillion, one hundred twenty-six billion, five hundred seventy million, six hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •