Base | Representation |
---|---|
bin | 111111110010000… |
… | …1101110001010111 |
3 | 12112011011102111112 |
4 | 1333210031301113 |
5 | 13340342400043 |
6 | 552211525235 |
7 | 104015254133 |
oct | 17744156127 |
9 | 5464142445 |
10 | 2140200023 |
11 | 9a90a5a55 |
12 | 4b88b981b |
13 | 281524760 |
14 | 1643523c3 |
15 | c7d58518 |
hex | 7f90dc57 |
2140200023 has 32 divisors (see below), whose sum is σ = 2483260416. Its totient is φ = 1827030528.
The previous prime is 2140200011. The next prime is 2140200047. The reversal of 2140200023 is 3200020412.
It is not a de Polignac number, because 2140200023 - 210 = 2140198999 is a prime.
It is a super-2 number, since 2×21402000232 = 9160912276898401058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2140199980 and 2140200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2140200053) 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 31 ways as a sum of consecutive naturals, for example, 3801140 + ... + 3801702.
It is an arithmetic number, because the mean of its divisors is an integer number (77601888).
Almost surely, 22140200023 is an apocalyptic number.
2140200023 is a deficient number, since it is larger than the sum of its proper divisors (343060393).
2140200023 is a wasteful number, since it uses less digits than its factorization.
2140200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863.
The product of its (nonzero) digits is 96, while the sum is 14.
The square root of 2140200023 is about 46262.2959114655. The cubic root of 2140200023 is about 1288.6988910401.
Adding to 2140200023 its reverse (3200020412), we get a palindrome (5340220435).
The spelling of 2140200023 in words is "two billion, one hundred forty million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •