Base | Representation |
---|---|
bin | 11111000011110000101… |
… | …100100110010110110101 |
3 | 21120001002222000122201112 |
4 | 133003300230212112311 |
5 | 234432113023031401 |
6 | 4312300404204405 |
7 | 310125661452461 |
oct | 37036054462665 |
9 | 7501088018645 |
10 | 2134342002101 |
11 | 753195466401 |
12 | 2a5796999705 |
13 | 126362b732ca |
14 | 754348974a1 |
15 | 3a7bc1203bb |
hex | 1f0f0b265b5 |
2134342002101 has 4 divisors (see below), whose sum is σ = 2142646835052. Its totient is φ = 2126037169152.
The previous prime is 2134342002097. The next prime is 2134342002113. The reversal of 2134342002101 is 1012002434312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1798278318001 + 336063684100 = 1340999^2 + 579710^2 .
It is a cyclic number.
It is not a de Polignac number, because 2134342002101 - 22 = 2134342002097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2134342007101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4152416090 + ... + 4152416603.
It is an arithmetic number, because the mean of its divisors is an integer number (535661708763).
Almost surely, 22134342002101 is an apocalyptic number.
It is an amenable number.
2134342002101 is a deficient number, since it is larger than the sum of its proper divisors (8304832951).
2134342002101 is an equidigital number, since it uses as much as digits as its factorization.
2134342002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8304832950.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2134342002101 its reverse (1012002434312), we get a palindrome (3146344436413).
The spelling of 2134342002101 in words is "two trillion, one hundred thirty-four billion, three hundred forty-two million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •