Base | Representation |
---|---|
bin | 1100010010110101000… |
… | …1101010010111110111 |
3 | 202012011210112012212100 |
4 | 3010231101222113313 |
5 | 11430031012032411 |
6 | 241010243353143 |
7 | 21155024616420 |
oct | 3045521522767 |
9 | 665153465770 |
10 | 211213002231 |
11 | 816362627a0 |
12 | 34b269827b3 |
13 | 16bc040403a |
14 | a31939a647 |
15 | 5762a8a456 |
hex | 312d46a5f7 |
211213002231 has 48 divisors (see below), whose sum is σ = 380886105600. Its totient is φ = 109571088960.
The previous prime is 211213002211. The next prime is 211213002263. The reversal of 211213002231 is 132200312112.
211213002231 is a `hidden beast` number, since 21 + 121 + 300 + 223 + 1 = 666.
It is not a de Polignac number, because 211213002231 - 214 = 211212985847 is a prime.
It is a super-2 number, since 2×2112130022312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211213002211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 300070 + ... + 715868.
It is an arithmetic number, because the mean of its divisors is an integer number (7935127200).
Almost surely, 2211213002231 is an apocalyptic number.
211213002231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
211213002231 is a deficient number, since it is larger than the sum of its proper divisors (169673103369).
211213002231 is a wasteful number, since it uses less digits than its factorization.
211213002231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416556 (or 416553 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 211213002231 its reverse (132200312112), we get a palindrome (343413314343).
The spelling of 211213002231 in words is "two hundred eleven billion, two hundred thirteen million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •