Base | Representation |
---|---|
bin | 101111111111000010101101… |
… | …011001100010101001010011 |
3 | 1000200020021012212210202210120 |
4 | 233333002231121202221103 |
5 | 210130141241041211011 |
6 | 2024502344225201323 |
7 | 62311111253566233 |
oct | 5777025531425123 |
9 | 1020207185722716 |
10 | 211040422210131 |
11 | 61275816585a98 |
12 | 1b80506a490243 |
13 | 909b046082167 |
14 | 3a185a786dcc3 |
15 | 195e9a432ea06 |
hex | bff0ad662a53 |
211040422210131 has 8 divisors (see below), whose sum is σ = 281974676858880. Its totient is φ = 140399891184072.
The previous prime is 211040422210081. The next prime is 211040422210151. The reversal of 211040422210131 is 131012224040112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211040422210131 - 217 = 211040422079059 is a prime.
It is a super-2 number, since 2×2110404222101312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211040422210151) 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, 73430903995 + ... + 73430906868.
It is an arithmetic number, because the mean of its divisors is an integer number (35246834607360).
Almost surely, 2211040422210131 is an apocalyptic number.
211040422210131 is a deficient number, since it is larger than the sum of its proper divisors (70934254648749).
211040422210131 is a wasteful number, since it uses less digits than its factorization.
211040422210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146861811345.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 211040422210131 its reverse (131012224040112), we get a palindrome (342052646250243).
The spelling of 211040422210131 in words is "two hundred eleven trillion, forty billion, four hundred twenty-two million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •