Base | Representation |
---|---|
bin | 10010010010111110111011… |
… | …01001100001101101010101 |
3 | 12021110101201211200200111102 |
4 | 21021133131221201231111 |
5 | 20233201104342443331 |
6 | 221323320001315445 |
7 | 11321600545222511 |
oct | 1111373551415525 |
9 | 167411654620442 |
10 | 40234677312341 |
11 | 11902481477296 |
12 | 4619900035b85 |
13 | 195b162cc7c65 |
14 | 9d1523ca9141 |
15 | 49b8e27304cb |
hex | 2497dda61b55 |
40234677312341 has 4 divisors (see below), whose sum is σ = 40235050734252. Its totient is φ = 40234303890432.
The previous prime is 40234677312331. The next prime is 40234677312373. The reversal of 40234677312341 is 14321377643204.
It is a happy number.
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 29304737158225 + 10929940154116 = 5413385^2 + 3306046^2 .
It is a cyclic number.
It is not a de Polignac number, because 40234677312341 - 226 = 40234610203477 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 (40234677312331) 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, 186549290 + ... + 186764843.
It is an arithmetic number, because the mean of its divisors is an integer number (10058762683563).
Almost surely, 240234677312341 is an apocalyptic number.
It is an amenable number.
40234677312341 is a deficient number, since it is larger than the sum of its proper divisors (373421911).
40234677312341 is a wasteful number, since it uses less digits than its factorization.
40234677312341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373421910.
The product of its (nonzero) digits is 2032128, while the sum is 47.
The spelling of 40234677312341 in words is "forty trillion, two hundred thirty-four billion, six hundred seventy-seven million, three hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •