Base | Representation |
---|---|
bin | 101111111110011101001011… |
… | …110110111011101111000011 |
3 | 1000200002102012220212101001020 |
4 | 233332131023312323233003 |
5 | 210124011232021322433 |
6 | 2024432042205440523 |
7 | 62305153642402404 |
oct | 5776351366735703 |
9 | 1020072186771036 |
10 | 211000131042243 |
11 | 6125a720236234 |
12 | 1b7b92a4b70143 |
13 | 90972c48a4c0a |
14 | 3a1666474b9ab |
15 | 195d8e6ed0cb3 |
hex | bfe74bdbbbc3 |
211000131042243 has 8 divisors (see below), whose sum is σ = 284723068394688. Its totient is φ = 138971973858984.
The previous prime is 211000131042193. The next prime is 211000131042293. The reversal of 211000131042243 is 342240131000112.
It is an interprime number because it is at equal distance from previous prime (211000131042193) and next prime (211000131042293).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211000131042243 - 29 = 211000131041731 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211000131042293) 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, 423695042005 + ... + 423695042502.
It is an arithmetic number, because the mean of its divisors is an integer number (35590383549336).
Almost surely, 2211000131042243 is an apocalyptic number.
211000131042243 is a deficient number, since it is larger than the sum of its proper divisors (73722937352445).
211000131042243 is an equidigital number, since it uses as much as digits as its factorization.
211000131042243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847390084593.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 211000131042243 its reverse (342240131000112), we get a palindrome (553240262042355).
The spelling of 211000131042243 in words is "two hundred eleven trillion, one hundred thirty-one million, forty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •