Base | Representation |
---|---|
bin | 1100010010110111110… |
… | …0110011000100000111 |
3 | 202012012120210201020110 |
4 | 3010231330303010013 |
5 | 11430041410410043 |
6 | 241011330004103 |
7 | 21155223003636 |
oct | 3045574630407 |
9 | 665176721213 |
10 | 211224310023 |
11 | 81641686481 |
12 | 34b2a716633 |
13 | 16bc2862c3c |
14 | a31aaa151d |
15 | 5763a70b33 |
hex | 312df33107 |
211224310023 has 8 divisors (see below), whose sum is σ = 281870887536. Its totient is φ = 140696969600.
The previous prime is 211224310007. The next prime is 211224310043. The reversal of 211224310023 is 320013422112.
211224310023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211224310023 - 24 = 211224310007 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211224310043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29805138 + ... + 29812223.
It is an arithmetic number, because the mean of its divisors is an integer number (35233860942).
Almost surely, 2211224310023 is an apocalyptic number.
211224310023 is a deficient number, since it is larger than the sum of its proper divisors (70646577513).
211224310023 is a wasteful number, since it uses less digits than its factorization.
211224310023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59618545.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 211224310023 its reverse (320013422112), we get a palindrome (531237732135).
The spelling of 211224310023 in words is "two hundred eleven billion, two hundred twenty-four million, three hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •