Base | Representation |
---|---|
bin | 1110001101111101100000… |
… | …01101101010100111111101 |
3 | 11002201000001220221000222222 |
4 | 13012332300031222213331 |
5 | 13044230303432220221 |
6 | 150255225100415125 |
7 | 6404616130142645 |
oct | 706766015524775 |
9 | 132630056830888 |
10 | 31266023320061 |
11 | 9a64934073772 |
12 | 360b693b474a5 |
13 | 145a4b132653a |
14 | 7a13d82c7525 |
15 | 39347ae099ab |
hex | 1c6fb036a9fd |
31266023320061 has 4 divisors (see below), whose sum is σ = 31384905538272. Its totient is φ = 31147141101852.
The previous prime is 31266023320057. The next prime is 31266023320139. The reversal of 31266023320061 is 16002332066213.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31266023320061 - 22 = 31266023320057 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31266023326061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59441108711 + ... + 59441109236.
It is an arithmetic number, because the mean of its divisors is an integer number (7846226384568).
Almost surely, 231266023320061 is an apocalyptic number.
It is an amenable number.
31266023320061 is a deficient number, since it is larger than the sum of its proper divisors (118882218211).
31266023320061 is a wasteful number, since it uses less digits than its factorization.
31266023320061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118882218210.
The product of its (nonzero) digits is 46656, while the sum is 35.
Adding to 31266023320061 its reverse (16002332066213), we get a palindrome (47268355386274).
The spelling of 31266023320061 in words is "thirty-one trillion, two hundred sixty-six billion, twenty-three million, three hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •