Base | Representation |
---|---|
bin | 10010010010111110010011… |
… | …00100110110000101011101 |
3 | 12021110100212100222220202002 |
4 | 21021133021210312011131 |
5 | 20233144412134301030 |
6 | 221323222331212045 |
7 | 11321556315552260 |
oct | 1111371144660535 |
9 | 167410770886662 |
10 | 40234340540765 |
11 | 11902319367878 |
12 | 46198272a7025 |
13 | 195b10b2c3c37 |
14 | 9d14d1282cd7 |
15 | 49b8c2dab245 |
hex | 2497c993615d |
40234340540765 has 16 divisors (see below), whose sum is σ = 55383648808320. Its totient is φ = 27486699766080.
The previous prime is 40234340540711. The next prime is 40234340540803. The reversal of 40234340540765 is 56704504343204.
40234340540765 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40234340540765 - 26 = 40234340540701 is a prime.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2136705431 + ... + 2136724260.
It is an arithmetic number, because the mean of its divisors is an integer number (3461478050520).
Almost surely, 240234340540765 is an apocalyptic number.
It is an amenable number.
40234340540765 is a deficient number, since it is larger than the sum of its proper divisors (15149308267555).
40234340540765 is a wasteful number, since it uses less digits than its factorization.
40234340540765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4273429972.
The product of its (nonzero) digits is 4838400, while the sum is 47.
Adding to 40234340540765 its reverse (56704504343204), we get a palindrome (96938844883969).
The spelling of 40234340540765 in words is "forty trillion, two hundred thirty-four billion, three hundred forty million, five hundred forty thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •