Base | Representation |
---|---|
bin | 1001001001101000111010… |
… | …10010101001110111111011 |
3 | 2122020200110120111221111020 |
4 | 10210310131102221313323 |
5 | 10114141200240224011 |
6 | 110444035314033523 |
7 | 4144540105113150 |
oct | 444643522516773 |
9 | 78220416457436 |
10 | 20122413211131 |
11 | 645895a738420 |
12 | 230ba375788a3 |
13 | b2c6c643108a |
14 | 4d7d03ca2227 |
15 | 24d66bb22006 |
hex | 124d1d4a9dfb |
20122413211131 has 16 divisors (see below), whose sum is σ = 33450245338368. Its totient is φ = 10453201668000.
The previous prime is 20122413211129. The next prime is 20122413211177. The reversal of 20122413211131 is 13111231422102.
It is not a de Polignac number, because 20122413211131 - 21 = 20122413211129 is a prime.
It is a super-2 number, since 2×201224132111312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20122413211111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43555006720 + ... + 43555007181.
It is an arithmetic number, because the mean of its divisors is an integer number (2090640333648).
Almost surely, 220122413211131 is an apocalyptic number.
20122413211131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20122413211131 is a deficient number, since it is larger than the sum of its proper divisors (13327832127237).
20122413211131 is a wasteful number, since it uses less digits than its factorization.
20122413211131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87110013922.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 20122413211131 its reverse (13111231422102), we get a palindrome (33233644633233).
The spelling of 20122413211131 in words is "twenty trillion, one hundred twenty-two billion, four hundred thirteen million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •