Base | Representation |
---|---|
bin | 10001100111110111100… |
… | …111110111001001011111 |
3 | 11021202220110212000012002 |
4 | 101213313213313021133 |
5 | 124320202244411111 |
6 | 2324202203032515 |
7 | 153331464061310 |
oct | 21476747671137 |
9 | 4252813760162 |
10 | 1211040232031 |
11 | 4276657038a3 |
12 | 17685ab0b73b |
13 | 8a27b95a696 |
14 | 428868ac607 |
15 | 2177e07563b |
hex | 119f79f725f |
1211040232031 has 4 divisors (see below), whose sum is σ = 1384045979472. Its totient is φ = 1038034484592.
The previous prime is 1211040232021. The next prime is 1211040232049. The reversal of 1211040232031 is 1302320401121.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1211040232031 - 222 = 1211036037727 is a prime.
It is a super-2 number, since 2×12110402320312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1211040231994 and 1211040232012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211040232021) 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, 86502873710 + ... + 86502873723.
It is an arithmetic number, because the mean of its divisors is an integer number (346011494868).
Almost surely, 21211040232031 is an apocalyptic number.
1211040232031 is a deficient number, since it is larger than the sum of its proper divisors (173005747441).
1211040232031 is an equidigital number, since it uses as much as digits as its factorization.
1211040232031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173005747440.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1211040232031 its reverse (1302320401121), we get a palindrome (2513360633152).
The spelling of 1211040232031 in words is "one trillion, two hundred eleven billion, forty million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •