Base | Representation |
---|---|
bin | 11111110010111010… |
… | …101001010110111101 |
3 | 10021010021212102201202 |
4 | 133302322221112331 |
5 | 1024404344343401 |
6 | 23403411345245 |
7 | 2316012114314 |
oct | 376272512675 |
9 | 107107772652 |
10 | 34140231101 |
11 | 1352a2a7a29 |
12 | 67495b2225 |
13 | 32b10750a2 |
14 | 191c26327b |
15 | d4c34e06b |
hex | 7f2ea95bd |
34140231101 has 8 divisors (see below), whose sum is σ = 34302321144. Its totient is φ = 33978274560.
The previous prime is 34140231089. The next prime is 34140231119. The reversal of 34140231101 is 10113204143.
It can be written as a sum of positive squares in 4 ways, for example, as 6048795076 + 28091436025 = 77774^2 + 167605^2 .
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 34140231101 - 222 = 34136036797 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 (34140234101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 499355 + ... + 563591.
It is an arithmetic number, because the mean of its divisors is an integer number (4287790143).
Almost surely, 234140231101 is an apocalyptic number.
It is an amenable number.
34140231101 is a deficient number, since it is larger than the sum of its proper divisors (162090043).
34140231101 is a wasteful number, since it uses less digits than its factorization.
34140231101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66751.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 34140231101 its reverse (10113204143), we get a palindrome (44253435244).
The spelling of 34140231101 in words is "thirty-four billion, one hundred forty million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •