Base | Representation |
---|---|
bin | 10011111111101000… |
… | …10001010000100101 |
3 | 1000201002120010121212 |
4 | 21333310101100211 |
5 | 133440442440310 |
6 | 4533054121205 |
7 | 530002261145 |
oct | 117764212045 |
9 | 30632503555 |
10 | 10734343205 |
11 | 4609290a23 |
12 | 20b6ab0205 |
13 | 1020b92691 |
14 | 73b8ba925 |
15 | 42c5b6205 |
hex | 27fd11425 |
10734343205 has 8 divisors (see below), whose sum is σ = 12881940000. Its totient is φ = 8586989136.
The previous prime is 10734343199. The next prime is 10734343231. The reversal of 10734343205 is 50234343701.
10734343205 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10734343205 - 216 = 10734277669 is a prime.
It is a super-2 number, since 2×107343432052 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57566 + ... + 157424.
It is an arithmetic number, because the mean of its divisors is an integer number (1610242500).
Almost surely, 210734343205 is an apocalyptic number.
It is an amenable number.
10734343205 is a deficient number, since it is larger than the sum of its proper divisors (2147596795).
10734343205 is an equidigital number, since it uses as much as digits as its factorization.
10734343205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121363.
The product of its (nonzero) digits is 30240, while the sum is 32.
Adding to 10734343205 its reverse (50234343701), we get a palindrome (60968686906).
The spelling of 10734343205 in words is "ten billion, seven hundred thirty-four million, three hundred forty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •