Base | Representation |
---|---|
bin | 10010010010111110010011… |
… | …00100110110000101011110 |
3 | 12021110100212100222220202010 |
4 | 21021133021210312011132 |
5 | 20233144412134301031 |
6 | 221323222331212050 |
7 | 11321556315552261 |
oct | 1111371144660536 |
9 | 167410770886663 |
10 | 40234340540766 |
11 | 11902319367879 |
12 | 46198272a7026 |
13 | 195b10b2c3c38 |
14 | 9d14d1282cd8 |
15 | 49b8c2dab246 |
hex | 2497c993615e |
40234340540766 has 32 divisors (see below), whose sum is σ = 80838467394048. Its totient is φ = 13349934433440.
The previous prime is 40234340540711. The next prime is 40234340540803. The reversal of 40234340540766 is 66704504343204.
40234340540766 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×402343405407663 (a number of 42 digits) contains 333 as substring.
It is a Curzon number.
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, 13472725 + ... + 16185888.
It is an arithmetic number, because the mean of its divisors is an integer number (2526202106064).
Almost surely, 240234340540766 is an apocalyptic number.
40234340540766 is an abundant number, since it is smaller than the sum of its proper divisors (40604126853282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40234340540766 is a wasteful number, since it uses less digits than its factorization.
40234340540766 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29659656.
The product of its (nonzero) digits is 5806080, while the sum is 48.
The spelling of 40234340540766 in words is "forty trillion, two hundred thirty-four billion, three hundred forty million, five hundred forty thousand, seven hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •