Base | Representation |
---|---|
bin | 1001100110101110111111… |
… | …11111010100100111101011 |
3 | 2202210020212022101000011111 |
4 | 10303113133333110213223 |
5 | 10232031041200110011 |
6 | 112531210411011151 |
7 | 4310010425430361 |
oct | 463273777244753 |
9 | 82706768330144 |
10 | 21122112113131 |
11 | 68039236a9997 |
12 | 2451734739ab7 |
13 | ba2a64206103 |
14 | 53045c32b631 |
15 | 26967bc0e121 |
hex | 1335dffd49eb |
21122112113131 has 8 divisors (see below), whose sum is σ = 21130460439840. Its totient is φ = 21113765209728.
The previous prime is 21122112113117. The next prime is 21122112113149. The reversal of 21122112113131 is 13131121122112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21122112113131 - 211 = 21122112111083 is a prime.
It is a super-2 number, since 2×211221121131312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21122112113111) 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, 29834610 + ... + 30534376.
It is an arithmetic number, because the mean of its divisors is an integer number (2641307554980).
Almost surely, 221122112113131 is an apocalyptic number.
21122112113131 is a deficient number, since it is larger than the sum of its proper divisors (8348326709).
21122112113131 is an equidigital number, since it uses as much as digits as its factorization.
21122112113131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 711653.
The product of its digits is 144, while the sum is 22.
Adding to 21122112113131 its reverse (13131121122112), we get a palindrome (34253233235243).
The spelling of 21122112113131 in words is "twenty-one trillion, one hundred twenty-two billion, one hundred twelve million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •