Base | Representation |
---|---|
bin | 110100100011011001110100… |
… | …001111010010010001101101 |
3 | 1010022100221100002221011122121 |
4 | 310203121310033102101231 |
5 | 220243323420434343041 |
6 | 2135324132423312541 |
7 | 66453454403221330 |
oct | 6443316417222155 |
9 | 1108327302834577 |
10 | 231131320231021 |
11 | 67711273764541 |
12 | 21b0a96b5ab751 |
13 | 9bc778923aa72 |
14 | 4110b5bd8c617 |
15 | 1bac3c92cc7d1 |
hex | d236743d246d |
231131320231021 has 16 divisors (see below), whose sum is σ = 265966743974400. Its totient is φ = 196754611662000.
The previous prime is 231131320230997. The next prime is 231131320231109. The reversal of 231131320231021 is 120132023131132.
231131320231021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 231131320231021 - 29 = 231131320230509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231131320031021) 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, 188941971 + ... + 190161328.
It is an arithmetic number, because the mean of its divisors is an integer number (16622921498400).
Almost surely, 2231131320231021 is an apocalyptic number.
It is an amenable number.
231131320231021 is a deficient number, since it is larger than the sum of its proper divisors (34835423743379).
231131320231021 is a wasteful number, since it uses less digits than its factorization.
231131320231021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 379103904.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 231131320231021 its reverse (120132023131132), we get a palindrome (351263343362153).
The spelling of 231131320231021 in words is "two hundred thirty-one trillion, one hundred thirty-one billion, three hundred twenty million, two hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •