Base | Representation |
---|---|
bin | 1000001011000111100111 |
3 | 11000212020002 |
4 | 20023013213 |
5 | 1022031240 |
6 | 113531515 |
7 | 24132632 |
oct | 10130747 |
9 | 4025202 |
10 | 2142695 |
11 | 1233925 |
12 | 873b9b |
13 | 5a0389 |
14 | 3dac19 |
15 | 2c4d15 |
hex | 20b1e7 |
2142695 has 4 divisors (see below), whose sum is σ = 2571240. Its totient is φ = 1714152.
The previous prime is 2142691. The next prime is 2142713. The reversal of 2142695 is 5962412.
It is a happy number.
2142695 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2142695 - 22 = 2142691 is a prime.
It is a super-2 number, since 2×21426952 = 9182283726050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2142691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 214265 + ... + 214274.
It is an arithmetic number, because the mean of its divisors is an integer number (642810).
22142695 is an apocalyptic number.
2142695 is a deficient number, since it is larger than the sum of its proper divisors (428545).
2142695 is an equidigital number, since it uses as much as digits as its factorization.
2142695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428544.
The product of its digits is 4320, while the sum is 29.
The square root of 2142695 is about 1463.7947260460. The cubic root of 2142695 is about 128.9199471273.
It can be divided in two parts, 2 and 142695, that multiplied together give a triangular number (285390 = T755).
The spelling of 2142695 in words is "two million, one hundred forty-two thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •