Base | Representation |
---|---|
bin | 11111000000110000001… |
… | …111110010001101101101 |
3 | 21112201202221111200111011 |
4 | 133000300033302031231 |
5 | 234404004441114041 |
6 | 4311004144225221 |
7 | 306652654340416 |
oct | 37006017621555 |
9 | 7481687450434 |
10 | 2131113223021 |
11 | 751888946942 |
12 | 2a503560b211 |
13 | 125c69c69443 |
14 | 75209b3a80d |
15 | 3a67d939e81 |
hex | 1f0303f236d |
2131113223021 has 8 divisors (see below), whose sum is σ = 2152283558400. Its totient is φ = 2109944264400.
The previous prime is 2131113223007. The next prime is 2131113223037. The reversal of 2131113223021 is 1203223111312.
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 2131113223021 - 29 = 2131113222509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2131113222983 and 2131113223001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131113223091) 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, 2920000 + ... + 3576118.
It is an arithmetic number, because the mean of its divisors is an integer number (269035444800).
Almost surely, 22131113223021 is an apocalyptic number.
It is an amenable number.
2131113223021 is a deficient number, since it is larger than the sum of its proper divisors (21170335379).
2131113223021 is a wasteful number, since it uses less digits than its factorization.
2131113223021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688379.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2131113223021 its reverse (1203223111312), we get a palindrome (3334336334333).
The spelling of 2131113223021 in words is "two trillion, one hundred thirty-one billion, one hundred thirteen million, two hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •