Base | Representation |
---|---|
bin | 10001100111000010000… |
… | …111011100000101100111 |
3 | 11021200120220200112102002 |
4 | 101213002013130011213 |
5 | 124311332442241020 |
6 | 2323533134235515 |
7 | 153300313604624 |
oct | 21470207340547 |
9 | 4250526615362 |
10 | 1210142540135 |
11 | 427244a08671 |
12 | 17664a355b9b |
13 | 8a167991749 |
14 | 427dd59334b |
15 | 2172a352975 |
hex | 119c21dc167 |
1210142540135 has 4 divisors (see below), whose sum is σ = 1452171048168. Its totient is φ = 968114032104.
The previous prime is 1210142540129. The next prime is 1210142540207. The reversal of 1210142540135 is 5310452410121.
It is a happy number.
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 1210142540135 - 26 = 1210142540071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1210142540098 and 1210142540107.
It is a congruent number.
It is an unprimeable number.
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, 121014254009 + ... + 121014254018.
It is an arithmetic number, because the mean of its divisors is an integer number (363042762042).
Almost surely, 21210142540135 is an apocalyptic number.
1210142540135 is a deficient number, since it is larger than the sum of its proper divisors (242028508033).
1210142540135 is an equidigital number, since it uses as much as digits as its factorization.
1210142540135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242028508032.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 1210142540135 its reverse (5310452410121), we get a palindrome (6520594950256).
The spelling of 1210142540135 in words is "one trillion, two hundred ten billion, one hundred forty-two million, five hundred forty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •