Base | Representation |
---|---|
bin | 1100010011010001100… |
… | …0110111011011010111 |
3 | 202012111010001202110122 |
4 | 3010310120313123113 |
5 | 11430302034044343 |
6 | 241030145142155 |
7 | 21161004114356 |
oct | 3046430673327 |
9 | 665433052418 |
10 | 211332331223 |
11 | 816976563a2 |
12 | 34b5a92a95b |
13 | 16c0c054700 |
14 | a32b17d99d |
15 | 576d2ac068 |
hex | 31346376d7 |
211332331223 has 24 divisors (see below), whose sum is σ = 234774096480. Its totient is φ = 190031063040.
The previous prime is 211332331169. The next prime is 211332331253. The reversal of 211332331223 is 322133233112.
It is not a de Polignac number, because 211332331223 - 26 = 211332331159 is a prime.
It is a super-4 number, since 4×2113323312234 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211332331192 and 211332331201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211332331253) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4640558 + ... + 4685876.
It is an arithmetic number, because the mean of its divisors is an integer number (9782254020).
Almost surely, 2211332331223 is an apocalyptic number.
211332331223 is a deficient number, since it is larger than the sum of its proper divisors (23441765257).
211332331223 is a wasteful number, since it uses less digits than its factorization.
211332331223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46059 (or 46046 counting only the distinct ones).
The product of its digits is 3888, while the sum is 26.
Adding to 211332331223 its reverse (322133233112), we get a palindrome (533465564335).
The spelling of 211332331223 in words is "two hundred eleven billion, three hundred thirty-two million, three hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •