Base | Representation |
---|---|
bin | 101101011001110110010… |
… | …011101001110001100111 |
3 | 102001021121022011111002102 |
4 | 231121312103221301213 |
5 | 402110012031321411 |
6 | 10345211330202315 |
7 | 441264520634156 |
oct | 55316623516147 |
9 | 12037538144072 |
10 | 3120131120231 |
11 | aa3270748424 |
12 | 42485172339b |
13 | 1982c4c358b8 |
14 | ab02d81159d |
15 | 56265e99d3b |
hex | 2d6764e9c67 |
3120131120231 has 4 divisors (see below), whose sum is σ = 3173014698600. Its totient is φ = 3067247541864.
The previous prime is 3120131120209. The next prime is 3120131120237. The reversal of 3120131120231 is 1320211310213.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3120131120231 - 226 = 3120064011367 is a prime.
It is a super-2 number, since 2×31201311202312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3120131120237) 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, 26441789096 + ... + 26441789213.
It is an arithmetic number, because the mean of its divisors is an integer number (793253674650).
Almost surely, 23120131120231 is an apocalyptic number.
3120131120231 is a deficient number, since it is larger than the sum of its proper divisors (52883578369).
3120131120231 is an equidigital number, since it uses as much as digits as its factorization.
3120131120231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52883578368.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3120131120231 its reverse (1320211310213), we get a palindrome (4440342430444).
The spelling of 3120131120231 in words is "three trillion, one hundred twenty billion, one hundred thirty-one million, one hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •