Base | Representation |
---|---|
bin | 110000000001011000011110… |
… | …010011000101000000001011 |
3 | 1000200210122021212021120011110 |
4 | 300001120132103011000023 |
5 | 210140310104403144321 |
6 | 2025104301121101403 |
7 | 62325533240426415 |
oct | 6001303623050013 |
9 | 1020718255246143 |
10 | 211201230131211 |
11 | 61327a3644a221 |
12 | 1b830268787863 |
13 | 90b0262816198 |
14 | 3a222a07b19b5 |
15 | 1963c66bab176 |
hex | c0161e4c500b |
211201230131211 has 8 divisors (see below), whose sum is σ = 281611539457024. Its totient is φ = 140795870446440.
The previous prime is 211201230131183. The next prime is 211201230131317. The reversal of 211201230131211 is 112131032102112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211201230131211 - 241 = 209002206875659 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211201230131611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1237310695 + ... + 1237481376.
It is an arithmetic number, because the mean of its divisors is an integer number (35201442432128).
Almost surely, 2211201230131211 is an apocalyptic number.
211201230131211 is a deficient number, since it is larger than the sum of its proper divisors (70410309325813).
211201230131211 is a wasteful number, since it uses less digits than its factorization.
211201230131211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2474820521.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 211201230131211 its reverse (112131032102112), we get a palindrome (323332262233323).
The spelling of 211201230131211 in words is "two hundred eleven trillion, two hundred one billion, two hundred thirty million, one hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •