Base | Representation |
---|---|
bin | 111111110010001… |
… | …1011001101001011 |
3 | 12112011021012222121 |
4 | 1333210123031023 |
5 | 13340401130201 |
6 | 552213032111 |
7 | 104015603434 |
oct | 17744331513 |
9 | 5464235877 |
10 | 2140255051 |
11 | 9a9133330 |
12 | 4b8925637 |
13 | 28154380c |
14 | 16436848b |
15 | c7d699a1 |
hex | 7f91b34b |
2140255051 has 4 divisors (see below), whose sum is σ = 2334823704. Its totient is φ = 1945686400.
The previous prime is 2140255021. The next prime is 2140255081. The reversal of 2140255051 is 1505520412.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (2140255021) and next prime (2140255081).
It is a cyclic number.
It is not a de Polignac number, because 2140255051 - 213 = 2140246859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2140255021) 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 3 ways as a sum of consecutive naturals, for example, 97284310 + ... + 97284331.
It is an arithmetic number, because the mean of its divisors is an integer number (583705926).
Almost surely, 22140255051 is an apocalyptic number.
2140255051 is a deficient number, since it is larger than the sum of its proper divisors (194568653).
2140255051 is a wasteful number, since it uses less digits than its factorization.
2140255051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194568652.
The product of its (nonzero) digits is 2000, while the sum is 25.
The square root of 2140255051 is about 46262.8906468240. The cubic root of 2140255051 is about 1288.7099357889.
Adding to 2140255051 its reverse (1505520412), we get a palindrome (3645775463).
The spelling of 2140255051 in words is "two billion, one hundred forty million, two hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •