Base | Representation |
---|---|
bin | 111100010010110… |
… | …1010111101011011 |
3 | 12012222220012222222 |
4 | 1320211222331123 |
5 | 13120411004321 |
6 | 532430534255 |
7 | 101064262610 |
oct | 17045527533 |
9 | 5188805888 |
10 | 2023141211 |
11 | 949012a33 |
12 | 48566738b |
13 | 2631ba4a0 |
14 | 1529a0507 |
15 | bc9343ab |
hex | 7896af5b |
2023141211 has 16 divisors (see below), whose sum is σ = 2532230400. Its totient is φ = 1573591968.
The previous prime is 2023141193. The next prime is 2023141259. The reversal of 2023141211 is 1121413202.
It is a de Polignac number, because none of the positive numbers 2k-2023141211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2023141211.
It is not an unprimeable number, because it can be changed into a prime (2023141411) 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 15 ways as a sum of consecutive naturals, for example, 183041 + ... + 193778.
It is an arithmetic number, because the mean of its divisors is an integer number (158264400).
Almost surely, 22023141211 is an apocalyptic number.
2023141211 is a deficient number, since it is larger than the sum of its proper divisors (509089189).
2023141211 is a wasteful number, since it uses less digits than its factorization.
2023141211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376898.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 2023141211 is about 44979.3420472110. The cubic root of 2023141211 is about 1264.7617773849.
Adding to 2023141211 its reverse (1121413202), we get a palindrome (3144554413).
It can be divided in two parts, 202 and 3141211, that added together give a palindrome (3141413).
The spelling of 2023141211 in words is "two billion, twenty-three million, one hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •